Old hamiltonian ideas from a new point of view

Mathematische Nachrichten

Volumn 186, Issue , 1997, Pages 251-258

  Stacho, Ladislav ^a  

^a INSTITUTE OF CHEMISTRY   (Slovakia)

Author keywords

Degree of vertex; Graph invariant; Hamiltonian cycle

Indexed keywords

EID: 0037945007     PISSN: 0025584X     EISSN: None     Source Type: Journal    
DOI: 10.1002/mana.3211860115     Document Type: Review

References (12)

1. AINOUCHE, A., and CHRISTOFIDES, N.: Conditions for the Existence of Hamiltonian Circuits in Graphs Based on Vertex Degrees, J. London Math Soc. (2) 32 (1985), 385-391.
2. AINOUCHE, A., and SCHIERMEYER, I.: Insertible Vertices, Neighborhood Intersections and Hamiltonicity, J. Graph Theory 20 (1995), 123-135
3. BEDROSSIAN, P., CHEN, G., and SCHELF, R. H.: A Generalization of FAN'S Condition for Hamiltonicity, Pancyclicity, and Hamiltonian Connectedness, Discrete Math. 115 (1993), 39-50
4. BONDY, J. A.: Large Cycles in Graphs, Discrete Math. 1 (1971), 121-132
5. BONDY, J. A., and CHVÁTAL, V.: A Method in Graph Theory, Discrete Math. 15 (1976), 111-135
6. DIRAC, G. A.: Some Theorems on Abstract Graphs, Proc. London Math. Soc. 2 (1952), 69-81
7. FAN, G. H.: New Sufficient Conditions for Cycles in Graphs, J. Combinatorial Theory B 37 (1984), 221-227
8. GOULD, R.J.: Updating the Hamiltonian Problem - a Survey, Graph Theory 15 (1991), 121-157
9. CHVÁTAL, V.: Oil Hamilton's Ideals, J. Combinatorial Theory B 12 (1972), 163-168
10. ORE, O.: Note on Hamiltonian Circuits, Amer. Math. Monthly 67 (1960), 55
11. POLICKÝ, I.: A Sufficient Condition for Hamiltonian Graphs, to appear in Math. Slovaca.
12. PÓSA, L.: A Theorem Concerning Hamilton Lines, Magyar Tud. Akad. Mat. Kutató Int. Közl. 7 (1962), 225-226