Page Number and Graph Treewidth

Li Xianglu
Additional contact information
Li Xianglu: Zhongyuan University of Technology, China

International Journal of Applied Metaheuristic Computing (IJAMC), 2010, vol. 1, issue 3, 53-58

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.

Date: 2010
References: Add references at CitEc
Citations:

Downloads: (external link)
http://services.igi-global.com/resolvedoi/resolve. ... 4018/jamc.2010070104 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:igg:jamc00:v:1:y:2010:i:3:p:53-58

Access Statistics for this article

International Journal of Applied Metaheuristic Computing (IJAMC) is currently edited by Peng-Yeng Yin

More articles in International Journal of Applied Metaheuristic Computing (IJAMC) from IGI Global
Bibliographic data for series maintained by Journal Editor ().