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

DOI10.1006/JCTB.2001.2060zbMATH Open1028.05056OpenAlexW1988376039MaRDI QIDQ1850571FDOQ1850571

Authors: 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

Recommendations

• Large contractible subgraphs of a 3-connected graph
• Contractible subgraphs in 3-connected graphs
• The contractible subgraph of 5-connected graphs
• On contractible 5-vertex subgraphs of a 3-connected graph
• On 3-connected graphs with contractible edge covers of size \(k\)

zbMATH Keywords

connectivitylongest cycleconnected subgraphlongest induced pathcontractable subgraph

Mathematics Subject Classification ID

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

Cites Work

• Graph theory
• Title not available (Why is that?)
• Title not available (Why is that?)
• \((k,g)\)-cages are 3-connected
• Contractible triples in 3-connected graphs
• Contractible subgraphs in 3-connected graphs

Cited In (7)

• Large contractible subgraphs of a 3-connected graph
• Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge
• Contractible small subgraphs in \(k\)-connected graphs
• On contractible 5-vertex subgraphs of a 3-connected graph
• High connectivity keeping sets in graphs and digraphs
• On small contractible subgraphs in 3-connected graphs of small average degree
• A connected subgraph maintaining high connectivity

This page was built for publication: Almost all 3-connected graphs contain a contractible set of \(k\) vertices

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