Embedding generalized Petersen graph in books
From MaRDI portal
Publication:295940
DOI10.1007/S11401-016-1010-4zbMATH Open1338.05059OpenAlexW2342876029MaRDI QIDQ295940FDOQ295940
Authors: Bin Zhao, Wei Xiong, Yingzhi Tian, Jixiang 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
Recommendations
Cites Work
- Graph theory with applications
- The Complexity of Coloring Circular Arcs and Chords
- A theorem on tait colorings with an application to the generalized Petersen graphs
- The book thickness of a graph
- Embedding connected double-loop networks with even cardinality in books
- Embedding the incomplete hypercube in books
- Embedding planar graphs in four pages
- 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
- On the page number of complete odd-partite graphs
- Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
- Degree constrained book embeddings
- On Crossing Sets, Disjoint Sets, and Pagenumber
- The pagenumber of the class of bandwidth-k graphs is \(k-1\)
Cited In (15)
- Title not available (Why is that?)
- Book embedding of Möbius cubes.
- A trade-off between page number and page width of book embeddings of graphs
- Embedding semistrong product of paths and cycles in books
- A survey on book-embedding of planar graphs
- Book embeddability of series-parallel digraphs
- Embedding connected double-loop networks with even cardinality in books
- On the page number of lexicographic product of paths and cycles in books
- Embedding connected double-loop networks with odd cardinality in books
- A genetic algorithm for finding the pagenumber of interconnection networks
- Strong edge chromatic index of the generalized Petersen graphs
- The matching book embeddings of pseudo-Halin graphs
- Embedding the Myceilski of a graph and the amalgamation of two graphs in pages
- Book embedding of graph bundles over a cycle with claw as a fibre
- Matching book thickness of generalized Petersen graphs
This page was built for publication: Embedding generalized Petersen graph in books
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q295940)
