Tight bounds for the vertices of degree k in minimally k‐connected graphs

DOI10.1002/jgt.22202zbMath1391.05087OpenAlexW2754295160MaRDI QIDQ4575523

Jens M. Schmidt

Publication date: 13 July 2018

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.22202

zbMATH Keywords

lower boundstightminimally \(k\)-connected graphsvertices of degree \(k\)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Connectivity (05C40) Vertex degrees (05C07)

Related Items (2)

Uniformly connected graphs ⋮ Improved approximation algorithms for \(k\)-connected \(m\)-dominating set problems

This page was built for publication: Tight bounds for the vertices of degree k in minimally k‐connected graphs