2 citations · 2 across the 2 of their papers we have counts for
2 papers
math.CO2009
Vertices of degree k in edge-minimal, k-edge-connected graphs
Carl Kingsford, Guillaume Marçais
Halin 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 g…
math.CO2009★ 2 cited
A synthesis for exactly 3-edge-connected graphs
Carl Kingsford, Guillaume Marçais
A multigraph is exactly k-edge-connected if there are exactly k edge-disjoint paths between any pair of vertices. We characterize the class of exactly 3-edge-connected graphs, givi…