Geodesic
Combinatorial Oriented Maps
Canadian journal of mathematics, Tome 31 (1979) no. 5, pp. 986-1004

Voir la notice de l'article provenant de la source Cambridge University Press

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”. 
Tutte, W. T. Combinatorial Oriented Maps. Canadian journal of mathematics, Tome 31 (1979) no. 5, pp. 986-1004. doi: 10.4153/CJM-1979-091-3
@article{10_4153_CJM_1979_091_3,
     author = {Tutte, W. T.},
     title = {Combinatorial {Oriented} {Maps}},
     journal = {Canadian journal of mathematics},
     pages = {986--1004},
     year = {1979},
     volume = {31},
     number = {5},
     doi = {10.4153/CJM-1979-091-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-091-3/}
}
TY  - JOUR
AU  - Tutte, W. T.
TI  - Combinatorial Oriented Maps
JO  - Canadian journal of mathematics
PY  - 1979
SP  - 986
EP  - 1004
VL  - 31
IS  - 5
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-091-3/
DO  - 10.4153/CJM-1979-091-3
ID  - 10_4153_CJM_1979_091_3
ER  - 
%0 Journal Article
%A Tutte, W. T.
%T Combinatorial Oriented Maps
%J Canadian journal of mathematics
%D 1979
%P 986-1004
%V 31
%N 5
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1979-091-3/
%R 10.4153/CJM-1979-091-3
%F 10_4153_CJM_1979_091_3

[1] 1. Brahana, H. R., Systems oJ circuits on two-dimensional manifolds, Ann. Math., (2). 23 (1921), 144–168. Google Scholar

[2] 2. Cori, R., Graphes planaires et systèmes de parenthèses, Centre National de la Recherche Scientifique, Institut Biaise Pascal, (1969). Google Scholar

[3] 3. Cori, R., Un code pour les graphes pla —aires et ses applications, Asterisk 27 (1975). Google Scholar

[4] 4. Edmonds, J. R., A combinatorial representation for polyhedral surfaces, Notices Amer. Math. Soc, 7 (1960), 646. Google Scholar

[5] 5. Jacques, A., Sur le genre d'une paire de substitutions, C. R. Acad. Sci. Pari. 267 (1968), 625–627. Google Scholar

[6] 6. Jacques, A., Constellations et graphes topologiques, In Combinatorial Theory and its Applications II, Budapest (1970). Google Scholar

[7] 7. Tutte, W. T., Connectivity in graphs (University of Toronto Press, 1966). Google Scholar

[8] 8. Walsh, T. R. S., Combinatorial enumeration of non-planar maps, Thesis, U. of Toronto (1971). Google Scholar

[9] 9. Walsh, T. R. S. and Lehman, A. B., Counting rooted maps by genus I, J. Combinatorial Theor. 13 (1972), 192–218. Google Scholar

Cité par Sources :