Book embedding of locally planar graphs on orientable surfaces
From MaRDI portal
Publication:2629277
DOI10.1016/j.disc.2016.05.006zbMath1339.05080OpenAlexW2418868967MaRDI QIDQ2629277
Atsuhiro Nakamoto, Takayuki Nozawa
Publication date: 5 July 2016
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2016.05.006
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Graph minors. VII: Disjoint paths on a surface
- Embedding planar graphs in four pages
- The book thickness of a graph
- Five-coloring maps on surfaces
- The pagenumber of toroidal graphs is at most seven
- On the pagenumber of complete bipartite graphs
- Subgraphs of graphs on surfaces with high representativity
- Colouring Eulerian triangulations
- Three-coloring graphs embedded on surfaces with all faces even-sided
- Graph treewidth and geometric thickness parameters
- On the Pagenumber of k-Trees
- Pagenumber of complete bipartite graphs
- Every planar map is four colorable
- The pagenumber of genus g graphs is O( g )
- Genus g Graphs Have Pagenumber O(√g)
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Dominating sets in triangulations on surfaces
- The pagenumber of \(k\)-trees is \(O(k)\)
This page was built for publication: Book embedding of locally planar graphs on orientable surfaces