Les 1-graphes finis et leurs morphismes

M. F. Lanz; P. Martin

Mathématiques et Sciences Humaines (1975)

  • Volume: 51, page 51-75
  • ISSN: 0987-6936

How to cite

top

Lanz, M. F., and Martin, P.. "Les 1-graphes finis et leurs morphismes." Mathématiques et Sciences Humaines 51 (1975): 51-75. <http://eudml.org/doc/94163>.

@article{Lanz1975,
author = {Lanz, M. F., Martin, P.},
journal = {Mathématiques et Sciences Humaines},
language = {fre},
pages = {51-75},
publisher = {Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique},
title = {Les 1-graphes finis et leurs morphismes},
url = {http://eudml.org/doc/94163},
volume = {51},
year = {1975},
}

TY - JOUR
AU - Lanz, M. F.
AU - Martin, P.
TI - Les 1-graphes finis et leurs morphismes
JO - Mathématiques et Sciences Humaines
PY - 1975
PB - Ecole Pratique des hautes études, Centre de mathématique sociale et de statistique
VL - 51
SP - 51
EP - 75
LA - fre
UR - http://eudml.org/doc/94163
ER -

References

top
  1. [1] Babai L., "Automorphism groups and edge-contraction", Discrete Math., 8(1974) , 13-20. Zbl0274.05108MR332554
  2. [2] Barbault M.C., Descles J.P., Transformations formelles et théories linguistiques, Paris, Dunod, Doc. de linguistique quantitative n°11, 1972. Zbl0242.68031MR471449
  3. [3] Berge C., Graphes et hypergraphes, Paris, Dunod, 1970. Zbl0213.25702MR357173
  4. [4] Boitet Ch., Sémantique et traduction automatique - quelques remarques, Grenoble, Publication du Groupe d'Etudes sur la Traduction Automatique, G-3000-A, 1974, 
  5. [5] Coray G., "Additive features in positional games", Proceedings sur les procédures informatiques d'apprentissage, OTAN, 1974, 243-269. Zbl0376.68064
  6. [6] Frucht R., "Die Gruppe des Petersenschen Graphen und der Kantensysteme : der regulären Polyeder", Comment. Math. Helv., 9 (1937), 217-223. Zbl0016.37601JFM63.0068.03
  7. [7] Frucht R., "Herstellung von Graphen mit vorgegebener abstrackten Gruppe", Compositio Math., 6 (1938), 239-250. Zbl0020.07804JFM64.0596.02
  8. [8] Frucht R., "Graphs of degree three with a given abstract group", Canad. J. Math., 1 (1949), 365-378. Zbl0034.25802MR32987
  9. [9] Gardner M., Problèmes et divertissements mathématiques, Paris, Dunod, 1964. Zbl0148.00307
  10. [10] Harary F., Graph theory, Reading, Addison-Welsey, 1969 (chap.14). Zbl0182.57702MR256911
  11. [11] Izbicki H., "Reguläre Graphen 3., 4. und 5. grades mit vorgegebenen abstrackten Automorphismengruppen, Farbenzahlen und Zusammenhangen ", Monath. Math., 61 (1957), 42-50. Zbl0077.17101MR86304
  12. [12] M S., Birkhoff G., Algèbre - Tome 1 - Structures fondamentales, Paris, Gauthier-Villars, 1970. Zbl0201.01801
  13. [13] Moon J., Topics on tournaments, New York, Holt Rinehart & Winston, 1968. Zbl0191.22701MR256919
  14. [14] Ore O., Theory of graphs, Providence, American Mathematical Society, Coll. Publ. n°38, 1962. Zbl0105.35401MR150753
  15. [15] Sabidussi G., "Graphs with given group and given graph-theoretical properties", Canad. J. Math., 9 (1957), 515-525. Zbl0079.39202MR94810
  16. [16] Sabidussi G., "On the minimum order of graphs with given automorphism group", Monath. Math., 63 (1959), 124-127. Zbl0085.37901MR104596
  17. [17] Tutte W.T., Connectivity in Graphs, Toronto, Toronto University Press, 1967 (chap. 6 & 7). Zbl0146.45603MR210617
  18. [18] Whitney H., "Congruent graphs and the connectivity of graphs ", Amer. J. Math., 54 (1932), 150-168. Zbl0003.32804MR1506881JFM58.0609.01

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.