论文信息 - Crossing numbers of graph embedding pairs on closed surfaces

Crossing numbers of graph embedding pairs on closed surfaces

We shall prove that any two graphs G1 and G2 can be embedded together on a closed surface of genus g with at most 4g · β(G1) · β(G2) crossing points on their edges if they are embeddable on the surface, where β(G) stands for the Betti number of G, and show several observations on crossings of graph embedding pairs. © 2000 John Wiley & Sons, Inc. J Graph Theory 36: 8–23, 2001

Seiya Negami | Seiya Negami

[1] Seiya Negami,et al. Diagonal Flips in Triangulations on Closed Surfaces with Minimum Degree at Least 4 , 1999, J. Comb. Theory, Ser. B.

[2] Seiya Negami,et al. Diagonal Flips of Triangulations on Closed Surfaces Preserving Specified Properties , 1996, J. Comb. Theory, Ser. B.

[3] Paul D. Seymour,et al. Irreducible Triangulations of Surfaces , 1996, Journal of combinatorial theory. Series B (Print).

[4] Seiya Negami,et al. Diagonal flips in triangulations of surfaces , 1994, Discret. Math..

[5] Seiya Negami,et al. Diagonal transformations of triangulation on surfaces , 1990 .

[6] Paul D. Seymour,et al. Graph minors. VII. Disjoint paths on a surface , 1988, J. Comb. Theory, Ser. B.

[7] David W. Barnette,et al. Generating the triangulations of the projective plane , 1982, J. Comb. Theory, Ser. B.

[8] Sóstenes Lins. A minimax theorem on circuits in projective graphs , 1981, J. Comb. Theory, Ser. B.