Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs

DOI10.1016/j.disc.2011.05.011zbMath1223.05107OpenAlexW1985975947MaRDI QIDQ2275458

Jin Yan

Publication date: 9 August 2011

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2011.05.011

zbMATH Keywords

nowhere-zero 3-flowdegree condition\(Z_{3}\)-connected

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40) Flows in graphs (05C21)

Related Items (4)

Degree sum of 3 independent vertices and \(Z_3\)-connectivity ⋮ Degree condition and \(Z_3\)-connectivity ⋮ The complexity of the zero-sum 3-flows ⋮ Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Degree sum condition for \(Z_{3}\)-connectivity in graphs
• Nowhere-zero \(Z_3\)-flows through \(Z_3\)-connectivity
• Ore-condition and \(Z_3\)-connectivity
• Nowhere-zero 3-flows in triangularly connected graphs
• Degree sum and nowhere-zero 3-flows
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• Note on Hamilton Circuits
• Ore Condition and Nowhere-Zero 3-Flows

This page was built for publication: Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs