Highly Influenced

# Re-embedding of projective-planar graphs

@article{Negami1988ReembeddingOP, title={Re-embedding of projective-planar graphs}, author={Seiya Negami}, journal={J. Comb. Theory, Ser. B}, year={1988}, volume={44}, pages={276-299} }

- Published 1988 in J. Comb. Theory, Ser. B
DOI:10.1016/0095-8956(88)90037-8

Our graphs are finite, undirected, simple ones combinatorially and have underlying spaces with canonical topology as l-complexes. Let G be a graph and F’ a surface. Two embeddings fi, f2: G -+ F’ are equivalent if there exists a homeomorphism h: F’ + F2 and an automorphism 0: G -+ G such that h 0 fi = f2 3 0. A graph G is said to be uniquely embeddable in F2 if there is precisely one equivalence class of embeddings of G into F’. An automorphism CJ: G + G is called a symmetry of an embeddingf: G… CONTINUE READING

#### From This Paper

##### Figures, tables, and topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-6 of 6 references