On the number of contractible triples in 3-connected graphs

DOI10.1016/j.jctb.2007.05.003zbMath1127.05060OpenAlexW2059924485MaRDI QIDQ2464158

Matthias Kriesell

Publication date: 10 December 2007

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

Full work available at URL: https://doi.org/10.1016/j.jctb.2007.05.003

zbMATH Keywords

connectivitycontractible edgecontractible triple

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

Every DFS Tree of a 3‐Connected Graph Contains a Contractible Edge

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• Contractible triples in 3-connected graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• Contractible subgraphs in 3-connected graphs
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen

This page was built for publication: On the number of contractible triples in 3-connected graphs