A constructive characterization of 3-connected triangle-free graphs

DOI10.1016/j.jctb.2006.06.002zbMath1113.05059OpenAlexW2116546239MaRDI QIDQ875938

Matthias Kriesell

Publication date: 16 April 2007

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.2006.06.002

zbMATH Keywords

contractionminorconnectivitytriangle-free

Mathematics Subject Classification ID

Graph minors (05C83) Connectivity (05C40)

Related Items (2)

Improving a chain theorem for triangle-free 3-connected matroids ⋮ Uniformly 3‐connected graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• How to contract an essentially 6-connected graph to a 5-connected graph
• Generalizaions of critical connectivity of graphs
• Zur Struktur minimal n-fach zusammenhängender Graphen
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Contractible non-edges in \(3\)-connected graphs
• Contractible non-edges in triangle-free graphs
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen
• Kuratowski's theorem
• Nonseparating cycles inK-Connected graphs
• Average degree and contractibility
• A note on primitive skew curves

This page was built for publication: A constructive characterization of 3-connected triangle-free graphs