Vertices of degree 6 in a 6-contraction critical graph

DOI10.1016/S1571-0653(04)00345-2zbMath1171.05349OpenAlexW2037740232MaRDI QIDQ3438934

Ken-ichi Kawarabayashi, Kiyoshi Ando, Atsushi Kaneko

Publication date: 29 May 2007

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

Full work available at URL: https://doi.org/10.1016/s1571-0653(04)00345-2

Mathematics Subject Classification ID

Connectivity (05C40)

Related Items (1)

The number of vertices of degree 7 in a contraction-critical 7-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• 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
• Contractible edges in minimally \(k\)-connected graphs
• Nonseparating cycles inK-Connected graphs
• Uncontractable 4-connected graphs

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