Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
Embedding graphs in books: a layout problem with applications to VLSI design
SIAM Journal on Algebraic and Discrete Methods
Improved self-reduction algorithms for graphs with bounded treewidth
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
The pagenumber of k-trees is O(k)
Discrete Applied Mathematics
Combinatorial Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Graph Theory With Applications
Graph Theory With Applications
| Hi-index | 0.00 |
Book-embedding of graph G involves embedding its vertices along the spine of the book and assigning its edges to pages of the book such that no two edges cross on the same page. The pagenumber of G is the minimum number of pages in a book-embedding of G. In this paper, the authors also examine the treewidth TW(G), which is the minimum k such that G is a subgraph of a k-tree. The authors then study the relationship between pagenumber and treewidth. Results show that PN(G)=TW(G), which proves a conjecture of Ganley and Heath showing that some known upper bounds for the pagenumber can be improved.