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

DOI10.1016/j.jctb.2005.04.003zbMath1075.05050OpenAlexW2009090738MaRDI QIDQ2573645

Tibor Jordán

Publication date: 22 November 2005

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2005.04.003

zbMATH Keywords

Connectivity of graphs2-connected orientationRigidity matroid

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40)

Related Items (14)

Packing spanning trees and spanning 2-connected \(k\)-edge-connected essentially \((2k-1)\)-edge-connected subgraphs ⋮ Spanning Rigid Subgraph Packing and Sparse Subgraph Covering ⋮ Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams ⋮ Packing of rigid spanning subgraphs and spanning trees ⋮ Count and cofactor matroids of highly connected graphs ⋮ Graph orientations with set connectivity requirements ⋮ Strongly 2-connected orientations of graphs ⋮ Spanning trees: A survey ⋮ On orienting graphs for connectivity: Projective planes and Halin graphs ⋮ What is on his mind? ⋮ On Frank's conjecture on \(k\)-connected orientations ⋮ Spectral conditions for graph rigidity in the Euclidean plane ⋮ Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs ⋮ Tournaments and Semicomplete Digraphs

Cites Work

• Connected rigidity matroids and unique realizations of graphs
• On the Problem of Decomposing a Graph into n Connected Factors
• Edge-Disjoint Spanning Trees of Finite Graphs
• On Generic Rigidity in the Plane
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the existence of \(k\) edge-disjoint 2-connected spanning subgraphs