Book embeddings of \(k\)-framed graphs and \(k\)-map graphs

DOI10.1016/j.disc.2023.113690zbMath1525.05027arXiv2003.07655MaRDI QIDQ6080147

Michael A. Bekos, Martin Gronemann, Giordano Da Lozzo, Chrysanthi N. Raftopoulou, Unnamed Author, Fabrizio Montecchiani

Publication date: 30 October 2023

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

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

zbMATH Keywords

book embeddings\(h\)-framed graphs\(k\)-map graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Two-page book embeddings of 4-planar graphs
• Sparsity. Graphs, structures, and algorithms
• Embedding planar graphs in four pages
• The book thickness of a graph
• Linear-time recognition of map graphs with outerplanar witness
• Characterizing and recognizing 4-map graphs
• A left-first search algorithm for planar graphs
• Embedding planar 5-graphs in three pages
• Planar graphs that need four pages
• Hamiltonian circuits in simplicial complexes
• Characterizing 5-map graphs by 2-fan-crossing graphs
• Graph treewidth and geometric thickness parameters
• Ein Sechsfarbenproblem auf der Kugel
• An annotated bibliography on 1-planarity
• Layered separators in minor-closed graph classes with applications
• The book thickness of 1-planar graphs is constant
• Extension of a theorem of Whitney
• Recognizing hole-free 4-map graphs in cubic time
• Succinct Representation of Balanced Parentheses and Static Trees
• Straight-Line Grid Drawings of 3-Connected 1-Planar Graphs
• Planar Embeddings with Small and Uniform Faces
• Stack and Queue Layouts via Layered Separators
• Map graphs
• Graphs with E Edges Have Pagenumber O(√E)
• Genus g Graphs Have Pagenumber O(√g)
• Bounds For Orthogonal 3-D Graph Drawing
• On Optimal 2- and 3-Planar Graphs
• Upward Partitioned Book Embeddings
• Quick k-Median, k-Center, and Facility Location for Sparse Graphs
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Halin graphs and the travelling salesman problem
• Degree constrained book embeddings
• Upward Book Embeddings of st-Graphs
• Four pages are indeed necessary for planar graphs
• Sorting Using Networks of Queues and Stacks
• The pagenumber of \(k\)-trees is \(O(k)\)
• Book embeddings of nonplanar graphs with small faces in few pages