Combinatorics, Probability and Computing
Group coloring is Π2P-complete
Theoretical Computer Science - Graph colorings
Group connectivity of graphs with diameter at most 2
European Journal of Combinatorics
Ore-condition and Z3-connectivity
European Journal of Combinatorics
Nowhere-zero 3-flows in triangularly connected graphs
Journal of Combinatorial Theory Series B
On mod (2p +1)-orientations of graphs
Journal of Combinatorial Theory Series B
Every line graph of a 4-edge-connected graph is Z3-connected
European Journal of Combinatorics
Z3-connectivity of 4-edge-connected 2-triangular graphs
European Journal of Combinatorics
An extremal problem on group connectivity of graphs
European Journal of Combinatorics
Group Connectivity of Complementary Graphs
Journal of Graph Theory
Flows and parity subgraphs of graphs with large odd-edge-connectivity
Journal of Combinatorial Theory Series B
A survey of Nordhaus-Gaddum type relations
Discrete Applied Mathematics
The smallest degree sum that yields graphic sequences with a Z3-connected realization
European Journal of Combinatorics
Contractible configurations on 3-flows in graphs satisfying the Fan-condition
European Journal of Combinatorics
Nowhere-zero 3-flows and modulo k-orientations
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |