On local structure of 9- and 10-connected graphs

DOI10.1007/s10958-012-0887-zzbMath1256.05133MaRDI QIDQ1930222

S. A. Obraztsova

Publication date: 10 January 2013

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-012-0887-z

zbMATH Keywords

\(k\)-connected graph; finite undirected graph; local structure of contraction critically \(k\)-connected graphs; local structure of minimally \(k\)-connected graphs; lower bounds for \(c_k\)

Mathematics Subject Classification ID

05C75: Structural characterization of families of graphs

05C40: Connectivity

Cites Work

• The number of vertices of degree 7 in a contraction-critical 7-connected graph
• 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 6 in a contraction critically 6-connected graph
• A degree sum condition for the existence of a contractible edge in a \(\kappa\)-connected graph
• Local structure of 7- and 8-connected graphs
• A recursive characterization of the 4-connected graphs
• Contractible edges in 7-connected graphs
• A local structure theorem on 5-connected graphs
• Nonseparating cycles inK-Connected graphs
• A theorem on n-connected graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item