Calcul du degré de retournement d'un graphe planaire

BIBLIOGRAPHIE 39
[14] G.K.KURATOWSKI, Sur le problème des courbes gauche en topologie,
Fund.Math, 15, 271-283,1930
[15] R.LAURINI., D.THOMPSON., Fundamentals of spatial information
systems, The APIC series, Academic Press, 1995
[16] R.LAURINI., F. MILLERET-RAFOORT, Les bases de données en
géomatique, Hermès, 1993
[17] E.L.LAWLER, combinatorial optimization, Networks and matroids,
Holt, Rinehart and Winston, New-York,1976
[18] J.LEHEL and Zs.TUZA, Triangle-free partial graphs and edgecovering
theorems, Discrete Math.30,(1982),59-63
[19] J.P. NZALI, H. TAPAMO, Digitalisation au Millimètre, 3 e Colloque
Africain sur la Recherche en Informatique (CARI ’96),P237-
246, Libreville, Gabon, Octobre 1996
[20] A.SCHRIJVER, Crash-course of combinatorial opitimization, Wiley,Chichester,1986
[21] G.SHÄEFER, Weighted matchings in genaral graphs, Master’s
thesis, Facbereich Informatik, Universität des Saarlandes,Saarbrücken,2000
[22] J.B SHEARER, A note on bipartite subgraphs of triangle-free subgraphs,
Random Structures and Algorithms 3,(1992),223-226
[23] H.STAMM-WILBRANDT, A simple linear time algorithm for embedding
maximal planar graphs, preprint, 14 pages, 1993
[24] C.THOMASSEN, The Erdös-Posa property for odd cycles in
graphs of large connectivity, manuscript (1999), 12 pages
[25] H-J.VOSS, Cycles and bridges in graphs, Mathematics and its applications
(East European Series) 49, 1991
[26] H.WHITNEY, Planar graphs, Fund. Math,21, 73-84, 1933
[27] D.WEST, Open problems column Vol. 14 of SIAM Activity Group,
Newsletter in Discrete Mathematics, Spring 1994
[28] M.YANNAKAKIS, Node and edge-deletion NP-Complete problems,
in ”proceedings of the 10th Annual ACM Symposium on
theory of computing”, 1978,296-313