Pagenumber of pathwidth-k graphs and strong pathwidth-k graphs

Discrete Mathematics

Volumn 259, Issue 1-3, 2002, Pages 361-368

  Togasaki, Mitsunori ^a   Yamazaki, Koichi ^a  

^a GUNMA UNIVERSITY   (Japan)

Author keywords

Book embedding; Pagenumber; Pathwidth; Strong pathwidth

Indexed keywords

EID: 33845810190     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(02)00542-3     Document Type: Article

References (12)

1. F. Bernhart, P.C. Kainen, The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979) 320-331.
2. T. Bilski, Embedding graphs in books: a survey, IEE Proc. E 139(2) (1992) 134-138.
3. H.L. Bodlaender, A linear time algorithm for finding tree-decompositions of small treewidth, SIAM J. Comput. 25 (1996) 1305-1317.
4. H.L. Bodlaender, A partial k-arboretum of graphs with bounded treewidth, Theoret. Comput. Sci. 209 (1998) 1-45.
5. F.R.K. Chung, F.T. Leighton, A.L. Rosenberg, Embedding graphs in books: a layout problem with applications to VLSI design, SIAM J. Algebraic Discrete Methods 8 (1987) 33-58.
6. H. Enomoto, T. Nakamigawa, K. Ota, On the pagenumber of complete bipartite graphs, J. Combin. Theory Ser. B 71 (1997) 111-120.
7. J.L. Ganley, L.S. Heath, The pagenumber of k-trees in O(k), Discrete Appl. Math. 109 (2001) 215-221.
8. M.R. Garey, D.S. Johnson, G.L. Miller, C.H. Papadimitriou, The complexity of ordering circular arc graphs and chords, SIAM J. Algebraic Discrete Methods 1 (1980) 216-227.
9. T. Hasunuma, The pagenumber of dc Bruijn and Kautz digraphs, Austral. Comput. Sci. Comm. 21(3) (1999) 232-246.
10. D.J. Muder, M.L. Weaver, D.B. West, Pagenumber of complete bipartite graphs, J. Graph Theory 12 (1988) 469-489.
11. R. Swaminathan, D. Giraraj, D.K. Bhatia, The pagenumber of the class of bandwidth-k graphs is k - 1, Inform. Process. Lett. 55 (1995) 71-74.
12. M. Yannakakis, Embedding planar graphs in four pages, J. Comput. System Sci. 38 (1989) 36-67.