On the Book Thickness of k-Trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2011

On the Book Thickness of k-Trees

Abstract

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.
Fichier principal
Vignette du fichier
1778-6512-1-PB.pdf (278.74 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990475 , version 1 (13-05-2014)

Identifiers

Cite

Vida Dujmović, David R. Wood. On the Book Thickness of k-Trees. Discrete Mathematics and Theoretical Computer Science, 2011, Vol. 13 no. 3 (3), pp.39--44. ⟨10.46298/dmtcs.550⟩. ⟨hal-00990475⟩

Collections

TDS-MACS
33 View
1088 Download

Altmetric

Share

Gmail Facebook X LinkedIn More