The pagenumber of k-trees is O(k)

Discrete Applied Mathematics

Volumn 109, Issue 3, 2001, Pages 215-221

  Ganley, Joseph L ^a   Heath, Lenwood S ^b  

^a Simplex Solutions Inc   (United States)

^b Virginia Polytechnic Institute and State University   (United States)

Author keywords

Book embedding; Graph embedding; k trees; Pagenumber; Treewidth

Indexed keywords

EID: 0012589030     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00178-5     Document Type: Article

References (14)

1. Bernhart F., Kainen P.C. The book thickness of a graph. J. Combina. Theory B. 27:1979;320-331.
2. Bodlaender H.L. A tourist guide through treewidth. Acta Cybernet. 11:1993;1-21.
3. Bodlaender H.L. A partial. k -arboretum of graphs with bounded treewidth Theoret. Comput. Sci. 209:1998;1-45.
4. Chung F.R.K., Leighton F.T., Rosenberg A.L. Embedding graphs in books: a layout problem with applications to VLSI design. SIAM J. Algebraic Discrete Meth. 8:1987;33-58.
5. Gavril F. The intersection graphs of subtrees in trees are exactly the chordal graphs. J. Combina. Theory B. 16:1974;47-56.
6. Heath L.S., Rosenberg A.L. Laying out graphs using queues. SIAM J. Comput. 21:1992;927-958.
7. Muder D.J., Weaver M.L., West D.B. Pagenumber of complete bipartite graphs. J. Graph Theory. 12:1988;469-489.
8. S.V. Pemmaraju, Exploring the Powers of Stacks and Queues via Graph Layouts, Ph.D. Thesis, Department of Computer Science, Virginia Polytechnic Institute and State University, Blacksburg, Virginia, 1992.
9. S. Rengarajan, C.E.V. Madhavan, Stack and queue number of 2-trees. In: Proceedings of the First International Computing and Combinatorics Conference, Vol. 959, Lecture Notes in Computer Science, 1995, Springer, Berlin, pp. 203-212.
10. Robertson N., Seymour P.D. Graph minors III: planar tree-width. J. Combina. Theory B. 36:1984;49-64.
11. Robertson N., Seymour P.D. Graph minors II: algorithmic aspects of tree-width. J. Algorithms. 7:1986;309-322.
12. Swaminathan R., Giraraj D., Bhatia D.K. The pagenumber of the class of bandwidth-. k graphs is k-1 Inform. Process. Lett. 55:1995;71-74.
13. Wimer T.V. Linear algorithms on. k -terminal graphs, Ph.D. Thesis, Department of Computer Science:1987;Clemson University, South Carolina.
14. Yannakakis M. Embedding planar graphs in four pages. J. Comput. Syst. Sci. 38:1989;36-67.