Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)
From MaRDI portal
Publication:291168
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
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
This page was built for publication: Minimal \(k\)-connected graphs with minimal number of vertices of degree \(k\)