Sparse graph certificates for mixed connectivity
From MaRDI portal
Publication:1781979
DOI10.1016/j.disc.2004.11.011zbMath1062.05082MaRDI QIDQ1781979
Publication date: 10 June 2005
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2004.11.011
05C40: Connectivity
Cites Work
- Unnamed Item
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- On mixed connectivity certificates
- \(k\)-connectivity and decomposition of graphs into forests
- Existenz gewisser Konfigurationen in \(n\)-gesättigten Graphen und in Graphen genügend großer Kantendichte
- Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for k-Vertex Connectivity
- On sparse subgraphs preserving connectivity properties
- A theorem on n-connected graphs
- Minimally n-line connected graphs.