Almost all 3-connected graphs contain a contractible set of \(k\) vertices

DOI10.1006/jctb.2001.2060zbMath1028.05056OpenAlexW1988376039MaRDI QIDQ1850571

Matthias Kriesell

Publication date: 10 December 2002

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.2001.2060

zbMATH Keywords

connectivitylongest cycleconnected subgraphlongest induced pathcontractable subgraph

Mathematics Subject Classification ID

Paths and cycles (05C38) Connectivity (05C40)

Related Items

On small contractible subgraphs in 3-connected graphs of small average degree ⋮ High connectivity keeping sets in graphs and digraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \((k,g)\)-cages are 3-connected
• Contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs