|
|
|
We prove that every 6k-connected graph contains k edge-disjoint 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.
Bibtex entry:
| AUTHOR | = | {Jord{\'a}n, Tibor}, |
| TITLE | = | {On the existence of $k$ edge-disjoint 2-connected spanning subgraphs}, |
| NOTE | = | {{\tt www.cs.elte.hu/egres}}, |
| INSTITUTION | = | {Egerv{\'a}ry Research Group, Budapest}, |
| YEAR | = | {2004}, |
| NUMBER | = | {TR-2004-05} |