论文信息 - Book embeddings of graphs - 字舞流文

Book embeddings of graphs

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iv

[1] C. Kuratowski. Sur le problème des courbes gauches en Topologie , 1930 .

[2] A. Itai,et al. QUEUES, STACKS AND GRAPHS , 1971 .

[3] Lenwood S. Heath. Algorithms for embedding graphs in books (planar, vlsi, fault-tolerant, hamiltonian cycle, trivalent) , 1985 .

[4] Arnold L. Rosenberg,et al. Embedding graphs in books: a layout problem with applications to VLSI design , 1985 .

[5] Mihalis Yannakakis,et al. Four pages are necessary and sufficient for planar graphs , 1986, Symposium on the Theory of Computing.

[6] Paul D. Seymour,et al. Graph minors. VIII. A kuratowski theorem for general surfaces , 1990, J. Comb. Theory, Ser. B.

[7] Vojtěch Rödl,et al. Mathematics of Ramsey Theory , 1991 .

[8] Lenwood S. Heath,et al. The pagenumber of genus g graphs is O(g) , 1992, JACM.

[9] Bogdan Oporowski,et al. Unavoidable minors of graphs of large type , 2002, Discret. Math..

[10] Jonathan L. Gross,et al. Topological Graph Theory , 1987, Handbook of Graph Theory.

[11] Bruce A. Reed,et al. Excluding any graph as a minor allows a low tree-width 2-coloring , 2004, J. Comb. Theory, Ser. B.