Skip to main content
Log in

Combinatorics of orientation reversing polygons

  • Research Papers
  • Published:
aequationes mathematicae Aims and scope Submit manuscript

Abstract

We give two combinatorial characterizations of orientation reversing polygons in graphs embedded on surfaces (r-polygons) and use the notion of skew embedding introduced in [7] to characterize “parity” embeddings: an embedding has its odd polygons coinciding with itsr-polygons if and only if the skew embedding is in an orientable surface. The concept of “imbalance”, central for the proof, does not seem to appear explicitly before in the literature. Possible algorithmic implications of the parity embedding theorem are briefly discussed.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Bondy, J. A. andMurty, U.,Graph theory with applications. MacMillan, London-Basingstoke, 1976.

    Google Scholar 

  2. Garey, M. R. andJohnson, D. S.,Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, 1979.

    Google Scholar 

  3. Giblin, P. J.,Graphs, surfaces and homology: an introduction to algebraic topology. Chapman and Hall, London, 1977.

    Google Scholar 

  4. Lawler, E. L.,Combinatorial optimization: networks and matroids. Holt, Rinehart and Winston, New York-Toronto, 1976.

    Google Scholar 

  5. Lins, S.,Graphs of maps. Ph.D. Thesis, University of Waterloo, 1980.

  6. Lins, S.,A minimax theorem on circuits in projective graphs. J. Combin. Theory Ser. B30 (1981). 253–262.

    Google Scholar 

  7. Lins, S.,Graph-encoded maps. J. Combin. Theory Ser. B32 (1982), 171–181.

    Google Scholar 

  8. Lovász, L.,2-matchings and 2-covers of hypergraphs. Acta Math. Acad. Sci. Hungar.26 (1975). 433–444.

    Google Scholar 

  9. Moise, E. E.,Geometric topology in dimensions 2 and 3. Springer, New York-Heidelberg-Berlin, 1977.

    Google Scholar 

  10. Ringel, G.,Map color theorem. Springer, Berlin, 1974.

    Google Scholar 

  11. Stahl, S.,Generalized embedding schemes. J. Graph Theory2 (1978), 41–52.

    Google Scholar 

  12. Vince, A.,Combinatorial maps. J. Combin. Theory Ser. B34 (1983), 1–21.

    Google Scholar 

  13. Vince, A.,Combinatorial classification of the regular polytopes. Preprint.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lins, S. Combinatorics of orientation reversing polygons. Aeq. Math. 29, 123–131 (1985). https://doi.org/10.1007/BF02189819

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02189819

Key words and phrases

AMS (1980) subject classification

Navigation