A survey on book-embedding of planar graphs
From MaRDI portal
Publication:2141323
DOI10.1007/s11464-022-1010-5zbMath1489.05029OpenAlexW4280557645MaRDI QIDQ2141323
Chuxiong Wu, Weihua Yang, Xiaxia Guan, Ji Xiang Meng
Publication date: 25 May 2022
Published in: Frontiers of Mathematics in China (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11464-022-1010-5
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
- Embedding generalized Petersen graph in books
- Two-page book embeddings of 4-planar graphs
- On the page number of complete odd-partite graphs
- The pagenumber of the class of bandwidth-k graphs is \(k-1\)
- Ordered sets, pagenumbers and planarity
- Embedding connected double-loop networks with even cardinality in books
- Embedding the incomplete hypercube in books
- Optimal book embeddings of the FFT, Benes, and barrel shifter networks
- Embedding planar graphs in four pages
- The book thickness of a graph
- Linear algorithms to recognize outerplanar and maximal outerplanar graphs
- Characterizations of outerplanar graphs
- Graphs drawn with few crossings per edge
- Lower bounds for the number of edge-crossings over the spine in a topological book embedding of a graph
- Embedding de Bruijn, Kautz and shuffle-exchange networks in books
- The pagenumber of toroidal graphs is at most seven
- Optimum embedding of complete graphs in books
- On the pagenumber of complete bipartite graphs
- Any maximal planar graph with only one separating triangle is Hamiltonian
- A theorem on graphs
- A genetic algorithm for finding the pagenumber of interconnection networks
- A survey on multi-loop networks.
- On dispersability of some products of cycles
- Embedding planar 5-graphs in three pages
- Planar graphs that need four pages
- Hamiltonian circuits in simplicial complexes
- Advancements on SEFE and partitioned book embedding problems
- Graph treewidth and geometric thickness parameters
- Each maximal planar graph with exactly two separating triangles is Hamiltonian
- An annotated bibliography on 1-planarity
- The book thickness of 1-planar graphs is constant
- Algorithms for graphs embeddable with few crossings per edge
- Extension of a theorem of Whitney
- On the pagenumber of trivalent Cayley graphs
- Book embedding of locally planar graphs on orientable surfaces
- Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
- Book Embedding of Toroidal Bipartite Graphs
- The Book Embedding Problem from a SAT-Solving Perspective
- The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
- A Theorem on Planar Graphs
- On Page Number of N-free Posets
- Minimal Obstructions for 1-Immersions and Hardness of 1-Planarity Testing
- Rectilinear drawings of graphs
- Pagenumber of complete bipartite graphs
- The Complexity of Coloring Circular Arcs and Chords
- 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 into a Three Page Book with O(m log n) Crossings of Edges over the Spine
- One-Page Book Embedding under Vertex-Neighborhood Constraints
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Degree constrained book embeddings
- On Crossing Sets, Disjoint Sets, and Pagenumber
- Book Embeddings of Regular Graphs
- Sorting Using Networks of Queues and Stacks
- On dispersable book embeddings
- The pagenumber of \(k\)-trees is \(O(k)\)
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A survey on book-embedding of planar graphs
