On fixed-order book thickness parameterized by the pathwidth of the vertex ordering

DOI10.1007/978-3-030-57602-8_21zbMath1482.68179OpenAlexW3047951060MaRDI QIDQ2039665

Jingui Huang, Jianxin Wang, Jie Chen, Yunlong Liu

Publication date: 5 July 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-57602-8_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring polygon-circle graphs
• A triangle-free circle graph with chromatic number 5
• Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis
• Parameterized algorithms for book embedding problems
• The Mixed Chinese Postman Problem Parameterized by Pathwidth and Treedepth
• New Limits to Classical and Quantum Instance Compression
• Fast Hamiltonicity Checking Via Bases of Perfect Matchings
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• Kernelization Lower Bounds by Cross-Composition
• The complexity of colouring circle graphs