Contractible triples in highly connected graphs

DOI10.1007/s00026-011-0070-0zbMath1235.05079OpenAlexW2097210284MaRDI QIDQ659608

Shinya Fujita, Ken-ichi Kawarabayashi

Publication date: 24 January 2012

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

Full work available at URL: https://doi.org/10.1007/s00026-011-0070-0

zbMATH Keywords

highly connected graphcontractible triples

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Connectivity (05C40)

Cites Work

• Contractible triples in 3-connected graphs
• Contractible cycles in graphs with girth at least 5
• Contractible subgraphs in 3-connected graphs
• Contractible edges and triangles in \(k\)-connected graphs
• Nonseparating cycles inK-Connected graphs
• How to Draw a Graph

This page was built for publication: Contractible triples in highly connected graphs