Problèmes ouverts. Représentation graphique d'un graphe

B. Leclerc; B. Monjardet

Mathématiques et Sciences Humaines (1969)

  • Volume: 26, page 51-57
  • ISSN: 0987-6936

How to cite

top

Leclerc, B., and Monjardet, B.. "Problèmes ouverts. Représentation graphique d'un graphe." Mathématiques et Sciences Humaines 26 (1969): 51-57. <http://eudml.org/doc/94045>.

@article{Leclerc1969,
author = {Leclerc, B., Monjardet, B.},
journal = {Mathématiques et Sciences Humaines},
language = {fre},
pages = {51-57},
publisher = {Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique},
title = {Problèmes ouverts. Représentation graphique d'un graphe},
url = {http://eudml.org/doc/94045},
volume = {26},
year = {1969},
}

TY - JOUR
AU - Leclerc, B.
AU - Monjardet, B.
TI - Problèmes ouverts. Représentation graphique d'un graphe
JO - Mathématiques et Sciences Humaines
PY - 1969
PB - Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
VL - 26
SP - 51
EP - 57
LA - fre
UR - http://eudml.org/doc/94045
ER -

References

top
  1. [1] Kuratowski C. — "Sur le problème des courbes gauches en topologie", Fund. Math., 15, 271-283. 1930. Zbl56.1141.03JFM56.1141.03
  2. [2] Whitney H. — "Non separable and planar graph", Trans. Am. Math. Soc., 34, 339-362. 1932. Zbl0004.13103MR1501641JFM58.0608.01
  3. [3] Zarankiewicz K. - "On a problem of P. Turan concerning graphs" , Fund. Math., 41, 137-145. 1954. Zbl0055.41605MR63641
  4. [4] Tutte W.T. — "An algorithm for graphic binary matroids ", Proc. Am. Math. Soc., 11, 905-917. 1960. Zbl0097.38905MR117173
  5. [5] Anslander L. & Porter S.V. — "On embedding graphs in the sphere", J. Math. Mech., 10, 517-523. 1961. Zbl0101.16704MR138101
  6. [6] Berge C. — Théorie des graphes et ses applications, Paris, Dunod, 1963. Zbl0121.40101MR155312
  7. [7] Harary F. & Hill A. — "On the number of crossings in the complete graph", Proc. Edimburgh Math. Soc., 13, 333-338. 1963. Zbl0118.18902MR163299
  8. [8] Youngs J.W.T. — "Minimal embeddings and the genus of a graph", J. Math. Mech., 12, 303-315. 1963. Zbl0109.41701MR145512
  9. [9] Demouchon G., Malgrange T. & Pertuiset R. —« Graphes planaires : reconnaissance et construction de représentations planaires topologiques », Revue Française de Recherche Opérationnelle, 8, 34-37. Avril 1964 Zbl0128.17203
  10. [10] Ghouila-Houri A. — « Flots et tensions dans les graphes », Parag. 2, Annales Sci. E.N.S., 81, 267-339. 1964. MR182575
  11. [11] Harary F. — "Recents results in topological graph theory", Acta Math. Acad. Sci. Hung., 15, 405-412. 1964. Zbl0127.39202MR166775
  12. [12] Tutte W.T. — "From matrices to graphs", Canad. J. of Math., 16, 108-127. 1964. Zbl0138.19202MR159317
  13. [13] Fisher G.J. & Wing O. — "Computer recognition and extraction of planar graphs from the incidence matrix", IEEE Trans. CT.B, 154-163. 1966. MR244078
  14. [14] Lempel A., Even S. & Cederbaum J. — "An Algorithm for planarity testing of graphs" - Théorie des graphes", Journées Internationales d'Étude, Rome, juillet 1966. Paris, Dunod, 1967. Zbl0197.50204
  15. [15] Hotz G. — "Einbettung von Streckenkomplexen in die Ebene", Math. Ann., 214-233. 1967. Zbl0144.23103MR204318
  16. [16] Bertin J. — Sémiologie graphique, Paris, Gauthier-Villars et Mouton, 1967. 
  17. [17] Barbut M. — « Idéogrammes, graphiques et géométrie », Mathématiques et Sciences Humaines, 6, 29-36. 1964. 
  18. [18] Guy R.K. — The crossing number of the complete graph, Mathematics Department, Univ. of Calgary, Calgary, Alberta, Research Paper n° 8, January 1967. 
  19. [19] Guy R.K. — "The decline and fall of Zarankiewiez's theorem", in Proof Techniques in Graph Theory, ed. by F. Harary, New York et Londres, Academic Press. 1969. Zbl0192.60601MR253931

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.