Book Embedding of Graphs on the Projective Plane
From MaRDI portal
Publication:5237910
DOI10.1137/16M1076174zbMath1425.05040OpenAlexW2978936508WikidataQ127185040 ScholiaQ127185040MaRDI QIDQ5237910
Takayuki Nozawa, Kenta Ozeki, Atsuhiro Nakamoto
Publication date: 25 October 2019
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/16m1076174
Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Embedding planar graphs in four pages
- The book thickness of a graph
- 4-connected projective planar graphs are Hamiltonian
- The pagenumber of toroidal graphs is at most seven
- On the pagenumber of complete bipartite graphs
- Graph treewidth and geometric thickness parameters
- A Theorem on Planar Graphs
- On the Pagenumber of k-Trees
- Pagenumber of complete bipartite graphs
- The pagenumber of genus g graphs is O( g )
- Graphs with E Edges Have Pagenumber O(√E)
- Genus g Graphs Have Pagenumber O(√g)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- On Hamilton cycles in certain planar graphs
- On Crossing Sets, Disjoint Sets, and Pagenumber
- Book Embeddings of Regular Graphs
- A theorem on paths in planar graphs
- The pagenumber of \(k\)-trees is \(O(k)\)
This page was built for publication: Book Embedding of Graphs on the Projective Plane