Embedding planar 5-graphs in three pages

DOI10.1016/J.DAM.2019.11.020zbMath1441.05160arXiv1801.07097OpenAlexW2995965358WikidataQ126542175 ScholiaQ126542175MaRDI QIDQ2185736

Xiaxia Guan, Weihua Yang

Publication date: 5 June 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1801.07097

zbMATH Keywords

book embeddingplanar graphpagenumber

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (9)

A survey on book-embedding of planar graphs ⋮ Book embeddings of \(k\)-framed graphs and \(k\)-map graphs ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ The Rique-number of graphs ⋮ Unnamed Item ⋮ Using Euler’s Formula to Find the Lower Bound of the Page Number ⋮ Recognizing DAGs with page-number 2 is NP-complete ⋮ On mixed linear layouts of series-parallel graphs ⋮ On Mixed Linear Layouts of Series-Parallel Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-page book embeddings of 4-planar graphs
• Ordered sets, pagenumbers and planarity
• Embedding planar graphs in four pages
• The book thickness of a graph
• Optimum embedding of complete graphs in books
• On the pagenumber of complete bipartite graphs
• A genetic algorithm for finding the pagenumber of interconnection networks
• Hamiltonian circuits in simplicial complexes
• Graph treewidth and geometric thickness parameters
• The Book Embedding Problem from a SAT-Solving Perspective
• Pagenumber of complete bipartite graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design

This page was built for publication: Embedding planar 5-graphs in three pages