On small contractible subgraphs in 3-connected graphs of small average degree

DOI10.1007/s00373-007-0749-5zbMath1129.05024OpenAlexW2006971352MaRDI QIDQ2464049

Matthias Kriesell

Publication date: 10 December 2007

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-007-0749-5

zbMATH Keywords

partitionconnectivityregularaverage degreecontractible

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (3)

Degree sequences and the existence of \(k\)-factors ⋮ On contractible 5-vertex subgraphs of a 3-connected graph ⋮ Large contractible subgraphs of a 3-connected graph

Cites Work

• Contractible triples in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Contractible subgraphs in 3-connected graphs
• Almost all 3-connected graphs contain a contractible set of \(k\) vertices
• On removable cycles through every edge
• Unnamed Item
• Unnamed Item

This page was built for publication: On small contractible subgraphs in 3-connected graphs of small average degree