Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected

DOI10.1016/J.EJC.2008.02.013zbMath1189.05086OpenAlexW2040681165MaRDI QIDQ1003612

Hong-Jian Lai, Yehong Shao, Lian-Ying Miao

Publication date: 4 March 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2008.02.013

zbMATH Keywords

minimum restricted edge cutminimally restricted \(k\)-edge connected

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (5)

Group connectivity and group colorings of graphs --- a survey ⋮ Group connectivity in line graphs ⋮ All 4-edge-connected HHD-free graphs are \({\mathbb{Z}}_3\)-connected ⋮ EVERY N₂-LOCALLY CONNECTED CLAW-FREE GRAPH WITH MINIMUM DEGREE AT LEAST 7 IS Z₃-CONNECTED ⋮ Group connectivity in \(J_3\) line graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
• Group connectivity of 3-edge-connected chordal graphs
• An equivalent version of the 3-flow conjecture
• Nowhere‐zero 3‐flows in locally connected graphs
• A Contribution to the Theory of Chromatic Polynomials
• Nowhere zero flows in line graphs

This page was built for publication: Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected