Book Embeddings of Regular Graphs
From MaRDI portal
Publication:5254031
DOI10.1137/140961183zbMath1329.05212OpenAlexW2088607003MaRDI QIDQ5254031
József Balogh, Gelasio Salazar
Publication date: 8 June 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/140961183
Geometric probability and stochastic geometry (60D05) Random graphs (graph-theoretic aspects) (05C80) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Related Items (2)
Cites Work
- Embedding planar graphs in four pages
- The book thickness of a graph
- The pagenumber of toroidal graphs is at most seven
- On the pagenumber of complete bipartite graphs
- Book drawings of complete bipartite graphs
- Book Embedding of Toroidal 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
- The book crossing number of a graph
- On Crossing Sets, Disjoint Sets, and Pagenumber
- An Alternative Proof of a Theorem of Erdos and Szekeres
- Asymptotics and random matrices with row-sum and column sum-restrictions
- Sorting Using Networks of Queues and Stacks
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Book Embeddings of Regular Graphs