Contractible triples in highly connected graphs

DOI10.1007/S00026-011-0070-0MaRDI QIDQ659608zbMATH OpenOpenAlexFDO

Authors 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

contractible tripleshighly connected graph

Mathematics Subject Classification ID

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

Recommendations

• Contractible triples in 3-connected graphs
• On the number of contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs
• Contractible edges and triangles in k-connected graphs
• scientific article; zbMATH DE number 4043878
• scientific article; zbMATH DE number 2108141
• Contractible edges in 3-connected graphs
• Contractible circuits in \(3\)-connected graphs
• Contractible non-edges in \(3\)-connected graphs
• Contractible edges in triangle-free graphs

Cites work

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

Cited in

(4)

• Cycles in k-connected graphs whose deletion results in a (k-2)-connected graph
• On the number of contractible triples in 3-connected graphs
• Contractible small subgraphs in \(k\)-connected graphs
• Highly parity linked graphs

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

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