Vertices of degree k in edge-minimal, k-edge-connected graphs

Simple item page
dc.creatorKingsford, Carl
dc.creatorMarçais, Guillaume
dc.date2009-05-07
dc.date.accessioned2026-07-07T13:12:42Z
dc.date.available2026-07-07T13:12:42Z
dc.descriptionHalin showed that every edge minimal, k-vertex connected graph has a vertex of degree k. In this note, we prove the analogue to Halin's theorem for edge-minimal, k-edge-connected graphs. We show there are two vertices of degree k in every edge-minimal, k-edge-connected graph.
dc.description3 pages
dc.identifierhttps://arxiv.org/abs/0905.1064
dc.identifierhttp://arxiv.org/abs/0905.1064
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/229654
dc.subjectCombinatorics
dc.subject05C40
dc.titleVertices of degree k in edge-minimal, k-edge-connected graphs
dc.typetext

Files

Collections

arXiv