On the book thickness of $k$-trees

zbMath1283.05145arXiv0911.4162MaRDI QIDQ5403004

David R. Wood, Vida Dujmović

Publication date: 25 March 2014

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

zbMATH Keywords

treewidthtree decompositionbook embeddingbook thicknesspagenumberstacknumber

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (6)

Crossing Minimization for 1-page and 2-page Drawings of Graphs with Bounded Treewidth ⋮ Parameterized analysis and crossing minimization problems ⋮ 1-page and 2-page drawings with bounded number of crossings per edge ⋮ Parameterized algorithms for book embedding problems ⋮ Parameterized Algorithms for Book Embedding Problems ⋮ Layouts of Expander Graphs

This page was built for publication: On the book thickness of $k$-trees