Skip to main content Accessibility help
×
Home

Combinatorial Oriented Maps

  • W. T. Tutte (a1)

Extract

An orientable map is often presented as a realization of a finite connected graph G in an orientable surface so that the complementary domains of G, the “faces” of the map are topological open discs. This is not the definition to be used in the paper. But let us contemplate it for a while.

On each edge of G we can recognize two opposite directed edges, or “darts”. Let θ be the permutation of the dart-set S that interchanges each dart with its opposite. The darts radiating from a vertex v occur in a definite cyclic order, fixed by a chosen positive sense of rotation on the surface. The cyclic orders at the various vertices are the cycles of a permutation P of S. The choice of P rather than P –l, which corresponds to the other sense of rotation, makes the map “oriented”.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Combinatorial Oriented Maps
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Combinatorial Oriented Maps
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Combinatorial Oriented Maps
      Available formats
      ×

Copyright

References

Hide All
1. Brahana, H. R., Systems oJ circuits on two-dimensional manifolds, Ann. Math., (2). 23 (1921), 144168.
2. Cori, R., Graphes planaires et systèmes de parenthèses, Centre National de la Recherche Scientifique, Institut Biaise Pascal, (1969).
3. Cori, R., Un code pour les graphes pla —aires et ses applications, Asterisk 27 (1975).
4. Edmonds, J. R., A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc, 7 (1960), 646.
5. Jacques, A., Sur le genre d'une paire de substitutions, C. R. Acad. Sci. Pari. 267 (1968), 625627.
6. Jacques, A., Constellations et graphes topologiques, In Combinatorial Theory and its Applications II, Budapest (1970).
7. Tutte, W. T., Connectivity in graphs (University of Toronto Press, 1966).
8. Walsh, T. R. S., Combinatorial enumeration of non-planar maps, Thesis, U. of Toronto (1971).
9. Walsh, T. R. S. and Lehman, A. B., Counting rooted maps by genus I, J. Combinatorial Theor. 13 (1972), 192218.
MathJax
MathJax is a JavaScript display engine for mathematics. For more information see http://www.mathjax.org.

Combinatorial Oriented Maps

  • W. T. Tutte (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed