Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)

DOI10.1007/s10958-016-2697-1zbMath1337.05065OpenAlexW2297884081MaRDI QIDQ291168

F. Blanchet-Sadri, M. Dambrine

Publication date: 7 June 2016

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

Full work available at URL: https://doi.org/10.1007/s10958-016-2697-1

zbMATH Keywords

\(k\)-connectivity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On some extremal connectivity results for graphs and matroids
• Zur Struktur minimal n-fach zusammenhängender Graphen
• Ecken vom Grad \(n\) in minimalen \(n\)-fach zusammenhängenden Graphen
• Minimally 2-connected graphs.
• On Minimal Blocks

This page was built for publication: Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)