10.46298/dmtcs.550
https://dmtcs.episciences.org/550
Dujmović, Vida
Vida
Dujmović
Wood, David R.
David R.
Wood
On the Book Thickness of k-Trees
Graphs and Algorithms
Every k-tree has book thickness at most k + 1, and this bound is best possible for all k \textgreater= 3. Vandenbussche et al. [SIAM J. Discrete Math., 2009] proved that every k-tree that has a smooth degree-3 tree decomposition with width k has book thickness at most k. We prove this result is best possible for k \textgreater= 4, by constructing a k-tree with book thickness k + 1 that has a smooth degree-4 tree decomposition with width k. This solves an open problem of Vandenbussche et al.
episciences.org
[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]
2015-06-09
2011-10-17
2011-10-17
en
journal article
https://hal.science/hal-00990475v1
1365-8050
https://dmtcs.episciences.org/550/pdf
VoR
application/pdf
Discrete Mathematics & Theoretical Computer Science
Vol. 13 no. 3
Graph and Algorithms
Researchers
Students