Local structure of 7- and 8-connected graphs

DOI10.1007/s10958-011-0615-0zbMath1402.05116OpenAlexW2073091595MaRDI QIDQ2256706

A. V. Pastor, S. A. Obraztsova

Publication date: 20 February 2015

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

Full work available at URL: https://doi.org/10.1007/s10958-011-0615-0

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40)

Related Items (1)

On local structure of 9- and 10-connected graphs

Cites Work

• The number of vertices of degree 7 in a contraction-critical 7-connected graph
• Some properties of contraction-critical 5-connected 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
• A recursive characterization of the 4-connected graphs
• Contractible edges in 7-connected graphs
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• 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
• Unnamed Item

This page was built for publication: Local structure of 7- and 8-connected graphs