Welcome to the InfoSci Platform
Page Number and Graph Treewidth

Page Number and Graph Treewidth

Li Xianglu
Copyright: © 2010 |Volume: 1 |Issue: 3 |Pages: 6
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781609609542|DOI: 10.4018/jamc.2010070104
Cite Article Cite Article

MLA

Xianglu, Li. "Page Number and Graph Treewidth." IJAMC vol.1, no.3 2010: pp.53-58. http://doi.org/10.4018/jamc.2010070104

APA

Xianglu, L. (2010). Page Number and Graph Treewidth. International Journal of Applied Metaheuristic Computing (IJAMC), 1(3), 53-58. http://doi.org/10.4018/jamc.2010070104

Chicago

Xianglu, Li. "Page Number and Graph Treewidth," International Journal of Applied Metaheuristic Computing (IJAMC) 1, no.3: 53-58. http://doi.org/10.4018/jamc.2010070104

Export Reference

Mendeley
Favorite Full-Issue Download

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.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.