All 4-edge-connected HHD-free graphs are Z₃-connected

DOI10.1007/S00373-010-0995-9zbMATH Open1234.05143OpenAlexW2009045308MaRDI QIDQ659731FDOQ659731

Authors: 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

Recommendations

• \(Z_3\)-connectivity of \(K_{1,3}\)-free graphs without induced cycle of length at least 5
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Nowhere‐zero 3‐flow and ‐connectedness in graphs with four edge‐disjoint spanning trees
• \({\mathbb{Z}_3}\)-connectivity of 4-edge-connected triangular graphs
• Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• On rigid circuit graphs
• On the algebraic theory of graph colorings
• 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
• Nowhere-zero 3-flows in triangularly connected graphs
• Title not available (Why is that?)
• On the semi-perfect elimination
• Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q659731)