The pagenumber of k-trees is O(k)

2001/05/01 by Joseph L. Ganley, Lenwood S. Heath · 1 citation
Computer Science · Mathematics · #Advanced Graph Theory Research #Combinatorics #Computer science #Discrete mathematics #Embedding #Graph #Graph Labeling and Dimension Problems #Interconnection Networks and Systems #Mathematics #Upper and lower bounds #Vertex (graph theory)

paper · doi:10.1016/s0166-218x(00)00178-5

crossref issued 2001/05/01 · crossref published 2001/05/01 · crossref published-print 2001/05/01 · openalex publication_date 2001/05/01 · crossref created 2002/07/25 · crossref deposited 2019/04/22 · openalex created_date 2025/10/10 · crossref indexed 2025/10/28 · openalex updated_date 2026/03/10

Citations

• Embedding Graphs in Books: A Layout Problem with Applications to VLSI Design
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Laying Out Graphs Using Queues
• The book thickness of a graph
• Graph minors. III. Planar tree-width
• A partial k-arboretum of graphs with bounded treewidth

Cited by

• Book embedding [wikipedia]