Automorphismes de graphes et planarité
Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 73-90. 
@incollection{AST_1976__38-39__73_0,
     author = {Fontet, Max},
     title = {Automorphismes de graphes et planarit\'e},
     booktitle = {Journ\'ees algorithmiques},
     series = {Ast\'erisque},
     pages = {73--90},
     publisher = {Soci\'et\'e math\'ematique de France},
     number = {38-39},
     year = {1976},
     mrnumber = {498268},
     zbl = {0354.05046},
     language = {fr},
     url = {http://www.numdam.org/item/AST_1976__38-39__73_0/}
}
TY  - CHAP
AU  - Fontet, Max
TI  - Automorphismes de graphes et planarité
BT  - Journées algorithmiques
AU  - Collectif
T3  - Astérisque
PY  - 1976
SP  - 73
EP  - 90
IS  - 38-39
PB  - Société mathématique de France
UR  - http://www.numdam.org/item/AST_1976__38-39__73_0/
LA  - fr
ID  - AST_1976__38-39__73_0
ER  - 
%0 Book Section
%A Fontet, Max
%T Automorphismes de graphes et planarité
%B Journées algorithmiques
%A Collectif
%S Astérisque
%D 1976
%P 73-90
%N 38-39
%I Société mathématique de France
%U http://www.numdam.org/item/AST_1976__38-39__73_0/
%G fr
%F AST_1976__38-39__73_0
Fontet, Max. Automorphismes de graphes et planarité, dans Journées algorithmiques, Astérisque, no. 38-39 (1976), pp. 73-90. http://www.numdam.org/item/AST_1976__38-39__73_0/

[1] Aho A. V., J. F. Hopcroft, D.D Ullmann : The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. | Zbl

[2] Cori R. : Un code pour les graphes planaires et ses applications, Thèse, Paris, 1973.

[3] Edmonds J.R : A combinatorial representation for oriented polyhedral surfaces M.A. Thesis University of Maryland USA, 1960.

[4] Fontet M. : Test d'isomorphie d'hypergraphes planaires 2nd Professionnal conference on Automata Theory and Formal Languages (Kaiserslautern). Lecture notes in Computer Sciences33, 93-98 (1975). | Zbl

[5] Fontet M. : Test d'isomorphie de deux graphes planaires, Actes des Journées Informatique et Combinatoire, Bordeaux 1975. | Zbl

[6] Fontet M. : A linear algorithm for testing isomorphism of planar graphs Third International Colloquim on Automata Languages and Programming, Edimburgh, juillet 1976. | Zbl

[7] Hopcroft J. F., R. E. Tarjan : Isomorphism of planar graphs in Complexity of Computer Computations R.E. Miller and J.W. Thatcher Eds Plenum Press, New-York, 131-152 (1972). | MR | Zbl

[8] Hopcroft J.F, R. E. Tarjan : A V log V algorithm for isomorphism of triconnected planar graphsJ. Comput. Syst. Sci. 7, 323-331, (1973). | DOI | MR | Zbl

[9] Hopcroft J.F, J.K Wong : A linear time algorithm for isomorphism of planar graphs (Preliminary Report) 6th ACM SIGACT, 1974. | MR | Zbl

[10] Jacques A. : Constellations et propriétés algébriques des graphes topologiques, Thèse Paris, 1969.

[11] Karp R.M : Reducibility among combinatorial problems in Complexity of Computer Computations R.E. Miller and J.W. Thatcher Eds Plenum Press, New-York, 85-103, (1972). | MR | Zbl

[12] Whitneyh. : A set of topological invariants for graphs, Amer.J. Maths. 55, 231-235 (1933). | DOI | JFM | MR