Triconnected planar graphs of maximum degree five are subhamiltonian
From MaRDI portal
(Redirected from Triconnected planar graphs of maximum degree five are subhamiltonian)
Recommendations
Cites work
- A Theorem on Planar Graphs
- Arc diagrams, flip distances, and Hamiltonian triangulations
- Computational geometry. Algorithms and applications.
- Computing Tutte paths
- Decremental SPQR-trees for Planar Graphs
- Embedding Outerplanar Graphs in Small Books
- Embedding planar 5-graphs in three pages
- Embedding planar graphs in four pages
- Hamiltonian circuits in simplicial complexes
- scientific article; zbMATH DE number 4016941 (Why is no real title available?)
- scientific article; zbMATH DE number 1002024 (Why is no real title available?)
- scientific article; zbMATH DE number 2080088 (Why is no real title available?)
- Note on Hamilton Circuits
- On triangulating planar graphs under the four-connectivity constraint
- Some localization theorems on Hamiltonian circuits
- Some Theorems on Abstract Graphs
- The book thickness of a graph
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- The Planar Hamiltonian Circuit Problem is NP-Complete
- Two-page book embeddings of 4-planar graphs
Cited in
(10)- Any maximal planar graph with only one separating triangle is Hamiltonian
- On mixed linear layouts of series-parallel graphs
- Embedding planar 5-graphs in three pages
- Recognizing DAGs with page-number 2 is NP-complete
- 5-Connected Toroidal Graphs are Hamiltonian-Connected
- On Mixed Linear Layouts of Series-Parallel Graphs
- Book embeddings of \(k\)-framed graphs and \(k\)-map graphs
- Recognizing DAGs with page-number 2 is NP-complete
- The Rique-number of graphs
- Universal geometric graphs
This page was built for publication: Triconnected planar graphs of maximum degree five are subhamiltonian
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5075803)
