Geodesic
Variations on the Hamiltonian Theme
Canadian mathematical bulletin, Tome 15 (1972) no. 1, pp. 57-62

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

As its name implies, this paper consists of observations on various topics in graph theory that stem from the concept of Hamiltonian cycle. We shall mainly adopt the notation and terminology of Harary [5]. However, we use vertices and edges for what are called "points" and "lines" in [5]. V(G), E(G) respectively will denote the sets of vertices and edges of graph G, and |X| will denote the cardinal of the set X.|V(G)| is the order of G, and |E(G)| the size of G. Throughout n is reserved for the order of G. 
Bondy, J. A. Variations on the Hamiltonian Theme. Canadian mathematical bulletin, Tome 15 (1972) no. 1, pp. 57-62. doi: 10.4153/CMB-1972-012-3
@article{10_4153_CMB_1972_012_3,
     author = {Bondy, J. A.},
     title = {Variations on the {Hamiltonian} {Theme}},
     journal = {Canadian mathematical bulletin},
     pages = {57--62},
     year = {1972},
     volume = {15},
     number = {1},
     doi = {10.4153/CMB-1972-012-3},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-012-3/}
}
TY  - JOUR
AU  - Bondy, J. A.
TI  - Variations on the Hamiltonian Theme
JO  - Canadian mathematical bulletin
PY  - 1972
SP  - 57
EP  - 62
VL  - 15
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-012-3/
DO  - 10.4153/CMB-1972-012-3
ID  - 10_4153_CMB_1972_012_3
ER  - 
%0 Journal Article
%A Bondy, J. A.
%T Variations on the Hamiltonian Theme
%J Canadian mathematical bulletin
%D 1972
%P 57-62
%V 15
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-012-3/
%R 10.4153/CMB-1972-012-3
%F 10_4153_CMB_1972_012_3

[1] 1. Bondy, J. A., Large cycles in graphs, Proc. of the First Louisiana Conference on Combinatorics, Graph Theory, and Computing, Louisiana State Univ., 1970 (ed. Mullin, R. C., Reid, K. B., Roselle, D. P.), 47-60. Google Scholar

[2] 2. Bondy, J. A., Large cycles in graphs, Discrete Mathematics 1 (1971), 121-132. Google Scholar

[3] 3. Chvátal, V., On Hamilton's ideals, Univ. of Waterloo preprint. Google Scholar

[4] 4. Gaudin, T., Herz, J.-C., and Rossi, P., Solution du Problème No. 29, Rev. Franc. Rech. Operationelle 8 (1964), 214-218. Google Scholar

[5] 5. Harary, F., Graph theory, Addison-Wesley, Reading, Mass., 1969. Google Scholar

[6] 6. Herz, J.-C., Duby, J.-J., and Vigué, F., Recherche systématique des graphes hypoHamiltoniens, in Theory of Graphs, Internat. Symposium, Rome (1966), (ed. P. Rosenstiehl), 153-159. Google Scholar

[7] 7. Lindgren, W. F., An infinite class of Hypo Hamiltonian graphs, Amer. Math. Monthly 74 (1967), 1087-1088. Google Scholar

[8] 8. Ore, O., Arc coverings of graphs, Ann. Mat. Pur. Appl. 55 (1961), 315-321. Google Scholar

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

[10] 10. Woodall, D. R., Sufficient conditions for circuits, J. London Math. Soc. (to appear). Google Scholar

Cité par Sources :