论文信息 - Re-embedding of projective-planar graphs

Re-embedding of projective-planar graphs

In this paper, we characterize those projective-plane 3-connected graphs which admit re-embeddings in a projective plane different from their original one. The results will be applied for analysis of the uniqueness and faithfulness of the embedding of 5-connected projective-planar graphs.

Seiya Negami

[1] H. Whitney. Congruent Graphs and the Connectivity of Graphs , 1932 .

[2] Seiya Negami. Unique and faithful embeddings of projective-planar graphs , 1985, J. Graph Theory.

[3] H. Whitney. 2-Isomorphic Graphs , 1933 .

[4] Seiya Negami,et al. Uniqueness and faithfulness of embedding of toroidal graphs , 1983, Discret. Math..

[5] Seiya Negami. Uniquely and faithfully embeddable projective-planar triangulations , 1984, J. Comb. Theory, Ser. B.