The pagenumber of toroidal graphs is at most seven

Discrete Mathematics

Volumn 175, Issue 1-3, 1997, Pages 87-96

  Endo, Toshiki ^a  

^a WASEDA UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012484459     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0012-365X(96)00144-6     Document Type: Article

References (10)

1. F. Bernhart and P.C. Kainen, The book thickness of a graph, J. Combin. Theory Ser. B 27 (1979) 320-331.
2. J.A. Bondy and U.S.R. Murty, Graph Theory with Applications (North-Holland, New York, 1976).
3. F. Chung, T. Leighton and A. Rosenberg, Embedding graphs in books: a layout problem with apprication to VLSI design, SIAM J. Discrete Algebraic Methods 8 (1987) 33-58.
4. L.S. Heath and S. Istrail, The pagenumber of genus g graphs is O(g), J. Assoc. Comput. Mach. 39 (1992) 479-501.
5. T.R. Jensen and B. Toft, Graph Coloring Problems (Wiley, New York, 1995).
6. S.M. Malitz, Genus g graphs have pagenumber O(√g), J. Algorithms 17 (1994) 85-109.
7. E. Spanier, Algebraic Topology (McGraw-Hill, New York, 1966).
8. A.T. White, Graphs, Groups and Surfaces (North-Holland, New York, 1984).
9. M. Yannakakis, Four pages are necessary and sufficient for planar graphs, Proc. 18th Ann. ACM Symp. on Theory of Computing (ACM, New York, 1986) 104-108.
10. M. Yannakakis, Embedding planar graphs in four pages, J. Comput. System Sci. 38 (1986) 36-67.