|
|
|
|
Библиографический список
|
|
| |
| 1. |
Харари Ф., Теория графов, Мир, М., 1973, 300 с.; Harary F., Graph Theory, Addison-Wesley, Reading, Mass., 1969, 274 pp.    |
| 2. |
Dirac G. A., “Some Theorems on Abstract Graphs”, Proc. London Math. Soc., s3–2:1 (1952), 69–81   |
| 3. |
Ore O., “Note on Hamilton Circuits”, Amer. Math. Monthly, 67:1 (1960), 55 |
| 4. |
Ore O., “Arc coverings of graphs”, Ann. Mat. Pura Appl., 55:1 (1961), 315–322 |
| 5. |
Posa L., “On the circuits of finite graphs”, Magyar Tud. Akad. Mat. Kutató Int. Közl., 8 (1963), 355–361 |
| 6. |
Chvatal V., “On Hamilton's ideals”, J. Combinat. Theory (B), 12:2 (1972), 163–168 |
| 7. |
Bondy J. A., Chvatal V., “A method in graph theory”, Discrete Math., 15:2 (1976), 111–135 |
| 8. |
Fan G. H., “New sufficient conditions for cycles in graphs”, J. Combinat. Theory (B), 37:3 (1984), 221–227 |
| 9. |
Faudree R. J., Gould R. J., Jacobson M. S., Schelp R. H., “Neighborhood unions and Hamiltonian properties in graphs”, J. Combinat. Theory (B), 47:1 (1989), 1–9 |
| 10. |
Gould R. J., “Advances on the Hamiltonian Problem – A Survey”, J. Graph Theory, 15:2 (1991), 121–157 |
| 11. |
Li H., “Generalizations of Diracs theorem in Hamiltonian graph theory – A survey”, Discrete Math., 313:19 (2013), 2034–2053  |
| 12. |
Goodman S. E., Hedetniemi S. T., “Sufficient Conditions for a graph to be Hamiltonian”, J. Combin Theory (B), 16:2 (1974), 175–180 |
