A constructive characterization of 3-connected triangle-free graphs

DOI10.1016/J.JCTB.2006.06.002MaRDI QIDQ875938zbMATH OpenOpenAlexFDO

Authors 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

connectivitycontractionminortriangle-free

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

Recommendations

• Characterization of a class of triangle-free graphs with a certain adjacency property
• A construction of 3-connected graphs
• On the structure of triangle-free 3-connected matroids
• A class of three-colorable triangle-free graphs
• 3-minimal triangle-free graphs
• scientific article; zbMATH DE number 4008436
• On triangle-free 3-connected matroids
• Triply existentially complete triangle-free graphs
• scientific article; zbMATH DE number 850231
• A structural result for 3-graphs

Cites work

• A note on primitive skew curves
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Average degree and contractibility
• Contractible non-edges in \(3\)-connected graphs
• Contractible non-edges in triangle-free graphs
• Generalizaions of critical connectivity of graphs
• Graph theory
• How to contract an essentially 6-connected graph to a 5-connected graph
• scientific article; zbMATH DE number 3166039 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• scientific article; zbMATH DE number 5043408 (Why is no real title available?)
• Kuratowski's theorem
• Nonseparating cycles inK-Connected graphs
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Über Minimalstrukturen von Graphen, insbesondere von n-fach zusammenhängenden Graphen

Cited in

(7)

• A construction of 3-connected graphs
• Improving a chain theorem for triangle-free 3-connected matroids
• scientific article; zbMATH DE number 4008436 (Why is no real title available?)
• Uniformly 3‐connected graphs
• A synthesis for uniformly 3-edge-connected graphs
• The structure of bull-free graphs I -- three-edge-paths with centers and anticenters
• 3-bounded property in a triangle-free distance-regular graph

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

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