Book embedding of graphs on the projective plane
From MaRDI portal
Recommendations
Cites work
- 4-connected projective planar graphs are Hamiltonian
- A theorem on paths in planar graphs
- A Theorem on Planar Graphs
- Book embedding of projective-planar graphs
- Book embeddings of regular graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Embedding planar graphs in four pages
- Genus g Graphs Have Pagenumber O(√g)
- Graph treewidth and geometric thickness parameters
- Graphs with E Edges Have Pagenumber O(√E)
- scientific article; zbMATH DE number 1002024 (Why is no real title available?)
- scientific article; zbMATH DE number 1156578 (Why is no real title available?)
- On Crossing Sets, Disjoint Sets, and Pagenumber
- On Hamilton cycles in certain planar graphs
- On the pagenumber of \(k\)-trees
- On the pagenumber of complete bipartite graphs
- Pagenumber of complete bipartite graphs
- The book thickness of a graph
- The pagenumber of k-trees is O(k)
- The pagenumber of genus g graphs is O( g )
- The pagenumber of toroidal graphs is at most seven
Cited in
(4)
This page was built for publication: Book embedding of graphs on the projective plane
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237910)