The new lower bound of the number of vertices of degree 5 in contraction critical 5-connected graphs

DOI10.1007/s00373-010-0907-zzbMath1225.05142OpenAlexW1969700476MaRDI QIDQ1959708

Jianji Su, Ting-Ting Li

Publication date: 7 October 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0907-z

zbMATH Keywords

fragment5-connectedcontraction critical

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Connectivity (05C40) Vertex degrees (05C07)

Related Items

The Average Degree of Minimally Contraction‐Critically 5‐Connected Graphs ⋮ The number of vertices of degree 5 in a contraction-critically 5-connected graph

Cites Work

• Unnamed Item
• Unnamed Item
• Some properties of contraction-critical 5-connected graphs
• 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