All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected

DOI10.1007/s00373-010-0995-9zbMath1234.05143OpenAlexW2009045308MaRDI QIDQ659731

Takuro Fukunaga

Publication date: 24 January 2012

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0995-9

zbMATH Keywords

HHD-free graph\({\mathbb{Z}}_3\)-connectivityEdge-connectivityNowhere-zero flow

Mathematics Subject Classification ID

Connectivity (05C40) Flows in graphs (05C21)

Cites Work

• Unnamed Item
• On rigid circuit graphs
• Nowhere-zero 3-flows in triangularly connected graphs
• Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• On the semi-perfect elimination
• An equivalent version of the 3-flow conjecture
• Nowhere‐zero 3‐flows in locally connected graphs
• On the algebraic theory of graph colorings

This page was built for publication: All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected