Geodesic
Three Remarkable Graphs
Canadian journal of mathematics, Tome 25 (1973) no. 2, pp. 397-411

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

In the development of any mathematical theory it is often advisable to test the known theoretical results in particular cases, for in this way we are able to judge the state of the subject, its strengths and its weaknesses. It is the purpose of this paper to put forward three remarkable graphs which can be used to indicate the progress being made in research in graph theory. We shall undertake three tasks - the construction of the graphs themselves, the investigation of their properties (insofar as the theory allows), and the indication of possible lines for further enquiry. 
Biggs, Norman. Three Remarkable Graphs. Canadian journal of mathematics, Tome 25 (1973) no. 2, pp. 397-411. doi: 10.4153/CJM-1973-040-1
@article{10_4153_CJM_1973_040_1,
     author = {Biggs, Norman},
     title = {Three {Remarkable} {Graphs}},
     journal = {Canadian journal of mathematics},
     pages = {397--411},
     year = {1973},
     volume = {25},
     number = {2},
     doi = {10.4153/CJM-1973-040-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-040-1/}
}
TY  - JOUR
AU  - Biggs, Norman
TI  - Three Remarkable Graphs
JO  - Canadian journal of mathematics
PY  - 1973
SP  - 397
EP  - 411
VL  - 25
IS  - 2
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-040-1/
DO  - 10.4153/CJM-1973-040-1
ID  - 10_4153_CJM_1973_040_1
ER  - 
%0 Journal Article
%A Biggs, Norman
%T Three Remarkable Graphs
%J Canadian journal of mathematics
%D 1973
%P 397-411
%V 25
%N 2
%U http://geodesic.mathdoc.fr/articles/10.4153/CJM-1973-040-1/
%R 10.4153/CJM-1973-040-1
%F 10_4153_CJM_1973_040_1

[1] 1. Benson, C. T. and Losey, N. E., On a graph of Hoffman and Singleton, J. Combinatorial Theory 11 (1971), 67–79. Google Scholar

[2] 2. Biggs, N. L., Intersection matrices for linear graphs (In: Combinatorial Mathematics and its Applications, Academic Press, 1971). Google Scholar

[3] 3. Biggs, N. L., Finite groups of automorphisms, London Math. Soc. Lecture Notes Series 6 (Cambridge Univ. Press, Cambridge, 1971). Google Scholar

[4] 4. Biggs, N. L., Spanning trees of dual graphs, J. Combinatorial Theory 11 (1971), 127–131. Google Scholar

[5] 5. Biggs, N. L. and Smith, D. H., On trivalent graphs, Bull. Lond. Math. Soc. 3 (1971), 155–158. Google Scholar

[6] 6. Brooks, R. L., On colouring the nodes of a network. Proc. Cambridge Philos. Soc. 37 (1941), 194–197. Google Scholar

[7] 7. Conway, J. H., Three lectures on exceptional groups (In: Finite simple groups, Academic Press, 1971). Google Scholar

[8] 8. Damerell, R. M., On Moore graphs (to appear in Proc. Cambridge Philos. Soc). Google Scholar

[9] 9. Frucht, R., Die Gruppe der Petersen'schen Graphen und der Kantensystem der regularen Polyheder, Comment. Math. Helv. 9 (1937), 217–223. Google Scholar

[10] 10. Harary, F., Graph theory (Addison-Wesley, Reading, 1969). Google Scholar

[11] 11. Hoffman, A. J. and Singleton, R. R., On Moore graphs with diameters 2 and 3, IBM J. Res. Develop. 4 (1960), 497–504. Google Scholar

[12] 12. Petersen, J., Die Theorie der regulären Graphen, Acta Math. 15 (1891), 193–220. Google Scholar

[13] 13. Read, R. C., An introduction to chromatic polynomials, J. Combinatorial Theory, 4 (1968), 52–71. Google Scholar

[14] 14. Sands, D. A., Dichromatic polynomials of linear graphs, Ph.D. Thesis, University of London, 1972. Google Scholar

[15] 15. Smith, D. H., On primitive and imprimitive graphs, Quart. J. Math. Oxford Ser. 22 (1971), 551–557. Google Scholar

[16] 16. Tutte, W. T., A non-Hamiltonian graph, Can. Math. Bull. 3 (1960), 1–5. Google Scholar

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

[18] 18. Tutte, W. T., A contribution to the theory of chromatic polynomials, Can. J. Math. 6 (1954), 80–91. Google Scholar

[19] 19. Tutte, W. T., Qn dichromatic polynomials, J. Combinatorial Theory 2 (1967), 301–320. Google Scholar

[20] 20. Vizing, V. G., On an estimate of the chromatic class of a p-graph (Russian), Diskret. Analiz. 3 (1964), 25–30. Google Scholar

[21] 21. Wong, W. J., Determination of a class of primitive permutation groups, Math. Z. 99 (1967), 235–246. Google Scholar

Cité par Sources :