Embedding generalized Petersen graph in books
From MaRDI portal
Publication:295940
DOI10.1007/s11401-016-1010-4zbMath1338.05059OpenAlexW2342876029MaRDI QIDQ295940
Bin Zhao, Yingzhi Tian, Wei Xiong, Ji Xiang Meng
Publication date: 14 June 2016
Published in: Chinese Annals of Mathematics. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11401-016-1010-4
Related Items (3)
A survey on book-embedding of planar graphs ⋮ Matching book thickness of generalized Petersen graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs
Cites Work
- Unnamed Item
- On the page number of complete odd-partite graphs
- The pagenumber of the class of bandwidth-k graphs is \(k-1\)
- Embedding connected double-loop networks with even cardinality in books
- Embedding the incomplete hypercube in books
- Embedding planar graphs in four pages
- The book thickness of a graph
- The pagenumber of toroidal graphs is at most seven
- Optimum embedding of complete graphs in books
- On the pagenumber of complete bipartite graphs
- A genetic algorithm for finding the pagenumber of interconnection networks
- Book Embedding of Toroidal Bipartite Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Degree constrained book embeddings
- On Crossing Sets, Disjoint Sets, and Pagenumber
- A theorem on tait colorings with an application to the generalized Petersen graphs
This page was built for publication: Embedding generalized Petersen graph in books
