Nowhere‐zero 3‐flows in locally connected graphs
From MaRDI portal
Publication:4800400
DOI10.1002/jgt.10085zbMath1015.05037OpenAlexW4241255945MaRDI QIDQ4800400
Publication date: 3 April 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10085
Related Items (29)
Group connectivity of graphs with diameter at most 2 ⋮ \(Z_3\)-connectivity of claw-free graphs ⋮ Group connectivity of complementary graphs ⋮ Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs ⋮ Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity ⋮ Group connectivity of bridged graphs ⋮ Spanning triangle-trees and flows of graphs ⋮ \(Z_3\)-connectivity in abelian Cayley graphs ⋮ Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees ⋮ \(Z_3\)-connectivity of wreath product of graphs ⋮ On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs ⋮ Degree condition and \(Z_3\)-connectivity ⋮ Mod $(2p+1)$-Orientation on Bipartite Graphs and Complementary Graphs ⋮ Group connectivity and group colorings of graphs --- a survey ⋮ Nowhere-zero 3-flows in matroid base graph ⋮ A dual version of the brooks group coloring theorem ⋮ Group connectivity in line graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ Group chromatic number of Halin graphs ⋮ Nowhere-zero 3-flows in triangularly connected graphs ⋮ The Chvátal-Erdős condition for group connectivity in graphs ⋮ Degree sum and nowhere-zero 3-flows ⋮ Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups ⋮ Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected ⋮ Nowhere-zero 3-flows of claw-free graphs ⋮ On group connectivity of graphs ⋮ EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED ⋮ Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
Cites Work
This page was built for publication: Nowhere‐zero 3‐flows in locally connected graphs
