Sparse certificates and removable cycles in \(l\)-mixed \(p\)-connected graphs
From MaRDI portal
Publication:2488209
DOI10.1016/j.orl.2004.05.008zbMath1099.05050MaRDI QIDQ2488209
Publication date: 25 August 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.05.008
05C40: Connectivity
Related Items
Cites Work
- Graph connectivity and its augmentation: Applications of MA orderings
- A mixed version of Menger's theorem
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- On mixed connectivity certificates
- On minimally \((n,\lambda)\)-connected graphs
- Grad und lokaler Zusammenhang in endlichen Graphen
- Kreuzungsfreie a,b-Wege in endlichen Graphen
- Removable Cycles in 2-Connected Graphs of Minimum Degree at Least Four
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- On sparse subgraphs preserving connectivity properties
- Unnamed Item