On the pagenumber of k-trees

DOI10.1137/080714208MaRDI QIDQ3583318zbMATH OpenOpenAlexFDO

Authors Jennifer Vandenbussche, Douglas B. West, Gexin Yu

Publication date 27 August 2010

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/080714208

zbMATH Keywords

\(k\)-treebook thicknesspagenumbertree decomposition

Mathematics Subject Classification ID

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

Recommendations

• The pagenumber of k-trees is O(k)
• Genus g Graphs Have Pagenumber O(√g)
• Embedding planar graphs in four pages
• Graphs with E Edges Have Pagenumber O(√E)
• The pagenumber of genus g graphs is O( g )

Cited in

(12)

• The typenumber of trees
• 1-page and 2-page drawings with bounded number of crossings per edge
• A (2k + 1)-regular graph with page-number k
• Local and union page numbers
• Book embedding of locally planar graphs on orientable surfaces
• scientific article; zbMATH DE number 5551578 (Why is no real title available?)
• Unraveling k-page graphs
• Book embedding of graphs on the projective plane
• On the book thickness of k-trees
• The pagenumber of k-trees is O(k)
• The pagenumber of the class of bandwidth-k graphs is k-1
• Directed acyclic outerplanar graphs have constant stack number

This page was built for publication: On the pagenumber of \(k\)-trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3583318)