scientific article; zbMATH DE number 7525495

DOI10.4230/LIPIcs.ESA.2019.58MaRDI QIDQ5075803

No author found.

Publication date: 11 May 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Hamiltonian graphbook embeddingplanar graphcomputational geometrygraph drawinggraph augmentationbounded degree graphSPQR decomposition

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Related Items (7)

Embedding planar 5-graphs in three pages ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ The Rique-number of graphs ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On mixed linear layouts of series-parallel graphs ⋮ On Mixed Linear Layouts of Series-Parallel Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-page book embeddings of 4-planar graphs
• Some localization theorems on Hamiltonian circuits
• Embedding planar graphs in four pages
• The book thickness of a graph
• On triangulating planar graphs under the four-connectivity constraint
• Arc diagrams, flip distances, and Hamiltonian triangulations
• Embedding planar 5-graphs in three pages
• Hamiltonian circuits in simplicial complexes
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• Note on Hamilton Circuits
• Embedding Outerplanar Graphs in Small Books
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Computing Tutte Paths
• Decremental SPQR-trees for Planar Graphs
• Some Theorems on Abstract Graphs

This page was built for publication: