On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds

DOI10.1007/s10958-012-0888-yzbMath1256.05134OpenAlexW1994664978MaRDI QIDQ1930223

A. V. Pastor, 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-0888-y

zbMATH Keywords

triconnected graphsminimal \(k\)-connected graphcontraction critical \(k\)-connected graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The number of vertices of degree 7 in a contraction-critical 7-connected graph
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Vertices of degree 6 in a contraction critically 6-connected graph
• Short proof of Menger's theorem
• Vertices of degree 5 in a contraction critically 5-connected graph
• A theorem on n-connected graphs

This page was built for publication: On vertices of degree \(k\) of minimal and contraction critical \(k\)-connected graphs: upper bounds