Construction sequences and certifying 3-connectivity
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3166039 (Why is no real title available?)
- scientific article; zbMATH DE number 3236772 (Why is no real title available?)
- scientific article; zbMATH DE number 3308985 (Why is no real title available?)
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs
- Checking geometric programs or verification of geometric structures
- Construction sequences and certifying 3-connectedness
- Designing programs that check their work
- Dividing a Graph into Triconnected Components
- Finding triconnected components of graphs
- Kuratowski's theorem
- Reflections on graph theory
- Segment graphs, depth-first cycle bases, 3-connectivity, and planarity of graphs
- The Planar Hamiltonian Circuit Problem is NP-Complete
- \(E_{11}\) and M theory
Cited in
(4)
This page was built for publication: Construction sequences and certifying 3-connectivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2428654)