On the existence of k edge-disjoint 2-connected spanning subgraphs

Authors:
Tibor Jordán
Affiliations:
Department of Operations Research, Eötvös University, Budapest, Hungary
Venue:
Journal of Combinatorial Theory Series B
Year:
2005

Citing 2
Cited 0

Connectivity and network flows

Handbook of combinatorics (vol. 1)
Connected rigidity matroids and unique realizations of graphs

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

We prove that every 6k-connected graph contains k edge-disjoint rigid (and hence 2-connected) spanning subgraphs. By using this result we can settle special cases of two conjectures, due to Kriesell and Thomassen, respectively: we show that every 12-connected graph G has a spanning tree T for which G - E(T) is 2-connected, and that every 18-connected graph has a 2-connected orientation.