Nowhere-zero 3-flows in triangularly connected graphs
From MaRDI portal
Publication:958692
DOI10.1016/j.jctb.2008.02.008zbMath1171.05026MaRDI QIDQ958692
Hong-Jian Lai, Cun-Quan Zhang, Rui Xu, Chuixiang Zhou, Geng-Hua Fan
Publication date: 8 December 2008
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jctb.2008.02.008
chordal graphs; locally connected; nowhere-zero flows; squares of graphs; 2-sum of graphs; triangularly connected
Related Items
\(Z_3\)-connectivity with independent number 2, Extendability of contractible configurations for nowhere-zero flows and modulo orientations, Group connectivity of bridged graphs, Degree sum of 3 independent vertices and \(Z_3\)-connectivity, Realizing degree sequences as \(Z_3\)-connected graphs, An extremal problem on group connectivity of graphs, A dual version of the brooks group coloring theorem, Nowhere-zero 3-flows and modulo \(k\)-orientations, A note on the inducibility of 4-vertex graphs, Group chromatic number of Halin graphs, Pósa-condition and nowhere-zero 3-flows, Group connectivity in line graphs, \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs, All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected, Degree sum condition for \(Z_{3}\)-connectivity in graphs, Nowhere-zero 3-flows of claw-free graphs, \(Z_3\)-connectivity of wreath product of graphs, Ore-condition and \(Z_3\)-connectivity, Degree sum and nowhere-zero 3-flows, Note on cycle double covers of graphs, A note on \(Z_3\)-connected graphs with degree sum condition, Nowhere-zero 3-flows in matroid base graph, Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs, Group connectivity in \(J_3\) line graphs, \(Z_3\)-connectivity of claw-free graphs, Group connectivity and group colorings of graphs --- a survey, Nowhere-zero 3-flows of graphs with independence number two, Two equivalent properties of \(\mathcal Z_3\)-connectivity, NZ-flows in strong products of graphs, EVERY N2-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z3-CONNECTED
Cites Work
- Unnamed Item
- Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Grötzsch's 3-color theorem and its counterparts for the torus and the projective plane
- Group connectivity of 3-edge-connected chordal graphs
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in squares of graphs
- Nowhere‐zero 3‐flows in locally connected graphs
- Claw‐decompositions and tutte‐orientations
- 25 pretty graph colouring problems
