Construction sequences and certifying 3-connectivity
From MaRDI portal
Publication:2428654
DOI10.1007/s00453-010-9450-9zbMath1239.05110MaRDI QIDQ2428654
Publication date: 26 April 2012
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-010-9450-9
3-connected; algorithms and data structures; removable edges; certifying algorithm; construction sequence; Tutte contraction
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Checking geometric programs or verification of geometric structures
- E 11 and M theory
- Construction Sequences and Certifying 3-Connectedness
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs
- Finding triconnected components of graphs
- Kuratowski's theorem
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Designing programs that check their work
- Reflections on graph theory
- Dividing a Graph into Triconnected Components