Splitting and contractible edges in 4-connected graphs

DOI10.1016/S0095-8956(02)00043-6zbMath1021.05064MaRDI QIDQ1400957

Akira Saito

Publication date: 17 August 2003

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

zbMATH Keywords

contractionsplitting4-connected graphs

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (3)

Reduction for 3-connected graphs of minimum degree at least four ⋮ A constructive characterization of 4-connected graphs ⋮ Contractible edges and liftable vertices in a 4-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Contractible edges in 3-connected graphs
• Generalizaions of critical connectivity of graphs
• A survey on contractible edges in graphs of a prescribed vertex connectivity
• A recursive characterization of the 4-connected graphs
• Untersuchungen über minimale \(n\)-fach zusammenhängende Graphen
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• Cyclic coloration of 3-polytopes
• Kuratowski's theorem
• Uncontractable 4-connected graphs
• A Reduction Method for Edge-Connectivity in Graphs

This page was built for publication: Splitting and contractible edges in 4-connected graphs