Non-contractible edges in a 3-connected graph

DOI10.1007/BF01299741zbMath0835.05035MaRDI QIDQ1900184

Yoshimi Egawa, Katsuhiro Ota, Akira Saito, Xingxing Yu

Publication date: 17 October 1995

Published in: Combinatorica (Search for Journal in Brave)

zbMATH Keywords

contractionconnectivityboundcutnon-contractible edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

Unnamed Item

Cites Work

• Non-separating cycles and discrete Jordan curves
• Contractible edges in 3-connected graphs
• Planarity and duality of finite and infinite graphs
• On 3-connected graphs with contractible edge covers of size \(k\)
• Cyclic coloration of 3-polytopes
• The 3‐connected graphs with a maximum matching containing precisely one contractible edge
• Unnamed Item

This page was built for publication: Non-contractible edges in a 3-connected graph