Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis

DOI10.1007/978-3-030-59267-7_35OpenAlexW3091830744MaRDI QIDQ2110740

Jingui Huang, Jie Chen, Yunlong Liu

Publication date: 22 December 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-59267-7_35

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (5)

Parameterized algorithms for linear layouts of graphs with respect to the vertex cover number ⋮ Fixed-parameter tractability for book drawing with bounded number of crossings per edge ⋮ Parameterized analysis and crossing minimization problems ⋮ On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering ⋮ On fixed-order book thickness parameterized by the pathwidth of the vertex ordering

Cites Work

• Unnamed Item
• On the chromatic number of multiple interval graphs and overlap graphs
• Covering and coloring polygon-circle graphs
• Optimum embedding of complete graphs in books
• Simpler algorithms for testing two-page book embedding of partitioned graphs
• A triangle-free circle graph with chromatic number 5
• Parameterized algorithms for book embedding problems
• The Complexity of Coloring Circular Arcs and Chords
• Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth
• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The complexity of colouring circle graphs
• The pagenumber of \(k\)-trees is \(O(k)\)

This page was built for publication: Fixed-order book thickness with respect to the vertex-cover number: new observations and further analysis