Affiliation:
1. Zhongyuan University of Technology, China
Abstract
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.
Subject
Decision Sciences (miscellaneous),Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Computer Science Applications,Modelling and Simulation,Statistics and Probability
Reference14 articles.
1. An introduction to chordal graphs and clique trees;J. R. S.Blair;Graph Theory and Sparse Matrix Computation,1993
2. A tourist guide through treewidth.;H. L.Bodlaender;Acta Cybernetica,1993
3. Improved self-reduction algorithms for graphs with bounded treewidth
4. Graph Theory with Applications