Vertices of degree 6 in a contraction critically 6-connected graph

DOI10.1016/S0012-365X(03)00228-0zbMath1029.05084OpenAlexW2048299112MaRDI QIDQ1417567

Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi

Publication date: 5 January 2004

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00228-0

zbMATH Keywords

6-connected graphContractible edgeContraction critically 6-connected

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (6)

On the structure of \(C_3\)-critical minimal 6-connected graphs ⋮ On local structure of 9- and 10-connected graphs ⋮ On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds ⋮ Minimally contraction-critically 6-connected graphs ⋮ Local structure of 7- and 8-connected graphs ⋮ A constructive characterization of contraction critical 8-connected graphs with minimum degree 9

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Disjunkte Fragmente in kritisch n-fach zusammenhängenden Graphen
• Generalizaions of critical connectivity of graphs
• Contractible edges in \(n\)-connected graphs with minimum degree greater than or equal to \([5n/4\)]
• Vertices of degree 5 in a contraction critically 5-connected graph
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs

This page was built for publication: Vertices of degree 6 in a contraction critically 6-connected graph