Advances on the Hamiltonian problem - A survey

Graphs and Combinatorics

Volumn 19, Issue 1, 2003, Pages 7-52

  Gould, Ronald J ^a  

^a EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0037900665     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-002-0492-x     Document Type: Review

References (248)

1. Abbasi, S.: Spanning cycles in dense graphs. Ph.D. thesis, Rutgers University 1999
2. Abderrezzak, M.E.K., Flandrin, E., Amar, D.: Cyclability and pancyclability in bi-partite graphs. Discrete Math. 236, 3-11 (2001)
3. Adler, I., Alon, N., Ross, S.M.: On the maximum number of hamiltonian paths in tournaments. Random Struct. Algorithms 18, 291-296 (2001)
4. Aigner, M., Brandt, S.: Embedding arbitrary graphs of maximum degree two. J. Lond. Math. Soc., Ser. II. 48, 39-51 (1993)
5. Aldred, R.E.L., Holton, D.A., Min, Z.K.: A degree characterization of pancyclicity. Discrete Math. 127, 23-29 (1994)
6. Alon, N., Fischer, E.: 2-Factors in dense graphs. Discrete Math. 152, 13-23 (1996)
7. Alon, N., Gutin, G.: Properly colored Hamilton cycles in edge colored complete graphs. Random Struct. Algorithms 11, 179-186 (1997)
8. Alon, N., Yuster, R.: H-factors in dense graphs. J. Comb. Theory, Ser. B 66, 269-282 (1996)
9. Alspach, B., Bermond, J.-C., Solteau, D.: Decompositions into cycles I. Cycles and rays (Montreal, 1987), NATO ASI Ser., Ser. C 301, 9-18 (1990)
10. Alspach, B., Heinrich, K., Mohar, B.: A note on Hamilton cycles in block-intersection graphs. Finite Geom. Comb. Designs - Contemp. Math. 111, 1-4 (1990)
11. Amar, D., Flandrin, E., Fournier, I., Germa, A.: Hamiltonian pancyclic graphs. Discrete Math. 46, 327 (1983)
12. Ainouche, A., Schiermeyer, I.: Insertible vertices, neighborhood intersections, and hamiltonicity. J. Graph Theory 20, 123-135 (1995)
13. Balakrishnan, R., Paulrajam, P.: Hamiltonian cycles in tensor product of graphs. Discrete Math. 186, 1-13 (1998)
14. Bang-Jensen, J., Gutin, G.: Alternating cycles and paths in edge-colored multigraphs: a survey. Discrete Math. 165-166, 39-60 (1997)
15. Bang-Jensen, J., Gutin, G.: Alternating cycles and trails in 2-edge colored complete multigraphs. Discrete Math. 188, 61-72 (1998)
16. Baranyai, Z., Szasz, Gy. R.: Hamiltonian decompositions of lexicographic product. J. Comb. Theory, Ser. B 31, 253-261 (1981)
17. Barr, O.: Properly coloured hamiltonian paths in edge-colored complete graphs without monochromatic triangles. Ars Comb. 50, 316-318 (1998)
18. Bauer, D., Broersma, H.J., Schmeichel, E.: More progress on tough graphs - the Y2K report. (preprint)
19. Bauer, D., Broersma, H.J., van den Heuvel, J., Veldman, H.J.: Long cycles in graphs with prescribed toughness and minimum degree. Discrete Math. 141, 1-10 (1995)
20. Bauer, D., Broersma, H.J., Li, R., Veldman, H.J.: A generalization of a result of Häggkvist and Nicoghossian. J. Comb. Theory, Ser. B 47, 237-243 (1989)
21. Bauer, D., Broersma, H.J., Veldman, H.J.: Not every 2-tough graph is hamiltonian. Discrete Appl. Math. 99, 317-321 (2000)
22. Bauer, D., Broersma, H.J., Veldman, H.J.: On generalizing a theorem of Jung. Ars Comb. 40, 207-218 (1995)
23. Bauer, D., Chen, G., Lasser, L.: A degree condition for hamiltonian cycles in t-tough graphs with t > I. Advances in Graph Theory, pp. 19-32, Gulbarga: Vishwa 1991
24. Bauer, D., Katona, G.Y., Kratsch, D., Veldman, H.J.: Chordality and 2-factors in tough graphs. Discrete Appl. Math. 99, 323-329 (2000)
25. Bauer, D., Schmeichel, E., Veldman, H.J.: Some recent results on long cycles in tough graphs. Graph Theory, combinatorics, and applications, Vol 1 (Kalamazoo, MI, 1988) pp. 113-123, New York: Wiley 1991
26. Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltonicity. Ph.D. Thesis, Memphis State University 1991
27. Benkouar, A., Manoussakis, Y., Paschos, V., Saad, R.: On the complexity of finding alternating hamiltonian and eulerian cycles in edge-colored graphs. Lect. Notes Comput. Sci. 557, 190-198 (1991)
28. Bermond, J.-C: Hamiltonian graphs. In: Beineke and Wilson, Selected Topics in Graph Theory, London: Academic Press 1978
29. Bermond, J.-C.: Hamilton decomposition of graphs, directed graphs and hypergraphs. In: Advances in Graph Theory. Ann. Discrete Math. 3, 21-28 (1978)
30. Bermond, J.-C.: Problem 97. Discrete Math. 71, 275-276 (1988)
31. Bermond, J.-C., Thomassen, C.: Cycles in digraphs - a survey. J. Graph Theory 5, 1-43 (1981)
32. Böhme, T., Harant, J., Tkáč, M.: More than l-tough chordal planar graphs are hamiltonian. J. Graph Theory 32, 405-410 (1999)
33. Bollobás, B., Brightwell, G.: Cycles through specified vertices. Combinatorica 13, 147-155 (1993)
34. Bollobás, B., Cooper, C., Fenner, T.I., Frieze, A.M.: Edge disjoint Hamilton cycles in sparse random graphs of minimum degree at least k, J. Graph Theory 34, 42-59 (2000)
35. Bollobás, B., Erdös, P.: Alternating hamiltonian cycles. Isr. J. Math. 23, 126-131 (1976)
36. Bollobás, B., Fenner, T.I., Frieze, A.M.: Hamilton cycles in random graphs of minimal degree at least k. A tribute to Paul Erdös, Cambridge: Cambridge University Press 1990
37. Bollobás, B., Riordan, O., Ryjáček, Z., Saito, S., Schelp, R.: Closure and hamiltonian-connectivity of claw-free graphs. Discrete Math. 195, 67-80 (1999)
38. Bollobás, B., Scott, A.D.: A proof of a conjecture of Bondy concerning paths in weighted digraphs. J. Comb. Theory, Ser. B 66, 283-292 (1996)
39. Bollobás, B., Thomason, A.: Highly linked graphs, Combinatorica 16, 313-320 (1996)
40. Bollobás, B., Thomason, A.: Weakly pancyclic graphs. J. Comb. Theory, Ser. B 77, 121-137 (1999)
41. Bondy, J.A.: Pancyclic graphs. J. Comb. Theory, Ser. B 11, 80-84 (1977)
42. Bondy, J.A.: Hamilton cycles in graphs and digraphs. (Proc. 9th S.E. Conf. Comb., Graph Theory and Computing) Congr. Numerantium 21, 3-28 (1978)
43. Bondy, J.A.: Basic graph theory - paths and cycles. Handbook of Combinatorics, Vol. I, pp. 5-110, Amsterdam: Elsevier 1995
44. Bondy, J.A., Broersma, H., van den Heuvel, J., Veldman, H.J.: Heavy cycles in weighted graphs. Discuss. Math.: Graph Theory (to appear)
45. Bondy, J.A., Chvátal, V.: A method in graph theory. Discrete Math. 15, 111-135 (1976)
46. Bondy, J.A., Fan, G.: Optimal paths and cycles in weighted graphs. Ann. Discrete Math. 41, 53-70 (1989)
47. Bondy, J.A., Fan, G.: Cycles in weighted graphs. Combinatorica, 11, 191-205 (1991)
48. Bondy, J.A., Jackson, B.: Vertices of small degree in uniquely hamiltonian graphs. J. Comb. Theory, Ser. B 74, 265-275 (1998)
49. Bosák, J.: Decompositions of Graphs. Dordrecht: Kluwer Academic Publishers 1990
50. Bosák, J.: Hamiltonian lines in cubic graphs. Theory of Graphs (Int. Symp., Rome, 1966), pp. 35-46, New York: Gordan and Breach 1967
51. Brandstädt, A., Dragan, F.F., Köhler, E.: Linear time algorithms for hamiltonian problems on (claw, net)-free graphs. SIAM J. Comput. 30, 1662-1677 (2000)
52. Brandt, S.: Cycles and paths in triangle-free graphs. In: R. Graham, J. Nesetril: The Mathematics of Paul Erdös, pp. 32-42, Springer 1996
53. Brandt, S.: A sufficient condition for all short cycles. Discrete Appl. Math. 79, 63-66 (1997)
54. Brandt, S.: 9-Connected claw-free graphs are hamilton-connected. J. Comb. Theory, Ser. B 75, 167-173 (1999)
55. Brandt, S., Faudree, R.J., Goddard, W.: Weakly pancyclic graphs. J. Graph Theory 27, 141-176 (1998)
56. Brandt, S., Chen, G., Faudree, R.J., Gould, R.J., Lesniak, L.: On the number of cycles in a 2-factor. J. Graph Theory 24, 165-173 (1997)
57. Brandt, S., Favaron, O., Ryjáček, Z.: Closure and stable hamiltonian properties in claw-free graphs. J. Graph Theory 34, 30-41 (2000)
58. Brandt, S., Veldman, H.J.: Degree sums for edges and cycle lengths in graphs. J. Graph Theory 25, 253-256 (1997)
59. Broersma, H.: On some intriguing problems in hamiltonian graph theory - a survey. Discrete Math. 251, 47-69 (2002)
60. Broersma, H., Kriesell, M., Ryjáček, Z.: On factors of 4-connected claw-free graphs. J. Graph Theory 37, 125-136 (2001)
61. Broersma, H., Li, H., Li, J.P., Tian, F., Veldman, H.J.: Cycles through subsets with large degree sums. Discrete Math. 171, 43-54 (1997)
62. Broersma, H., Ryjáček, Z.: Strengthening the closure concept in claw-free graphs. Discrete Math. 233, 55-63 (2001)
63. Broersma, H., Ryjáček, Z., Schiermeyer, I.: Closure concepts: a survey. Graphs Comb. 16, 17-48 (2000)
64. Broersma, H., van den Heuvel, J., Veldman, H.J.: A generalization of Ore's theorem involving neighborhood unions. Discrete Math. 122, 37-49 (1993)
65. 1,3-free graphs. In: R. Bodendiek: Contemporary Methods in Graph Theory, pp. 181-194, Mannheim Wien Zurich: BI-Wiss.-Verl. 1990
66. Broder, A.Z., Frieze, A.M., Shamir, E.: Finding hidden hamiltonian cycles. Random Struct. Algorithms 5, 395-410 (1994)
67. Brousek, J.: Forbidden triples and hamiltonicity. Discrete Math. 251, 71-76 (2002)
68. Chartrand, G., Lesniak, L.: Graphs & Digraphs. Third Edn. London: Chapman & Hall 1996
69. Chen, C.C., Daykin, D.E.: Graphs with hamiltonian cycles having adjacent lines different colors. J. Comb. Theory, Ser. B 21, 135-139 (1976)
70. Chen, G., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L., Pfender, F.: Linear forests and ordered cycles. (preprint)
71. Chen, G., Faudree, R.J., Gould, R.J., Lesniak, L., Jacobson, M.S.: Cycles in 2-factors of balanced bipartite graphs. Graphs Comb. 16, 67-80 (2000)
72. Chen, G., Faudree, J.R., Gould, R.J., Saito, A.: 2-Factors in claw-free graphs. Discuss. Math. Graph Theory 20, 165-172 (2000)
73. Chen, G., Gould, R.J., Pfender, F.: New conditions for k-ordered hamiltonian graphs. (preprint)
74. Chen, G., Jacobson, M.S.: Degree sum conditions for hamiltonicity on k-partite graphs. Graphs Comb. 13, 325-343 (1997)
75. Chen, G., Jacobson, M.S., Kézdy, A.E., Lehel, J.: Tough enough chordal graphs are hamiltonian. Networks 31, 29-38 (1998)
76. Chen, G., Liu, Y.: Hamiltonian graphs with large neighborhood unions. Ars Comb. 46, 227-238 (1997)
77. Chen, G., Schelp, R.: Hamiltonian graphs with neighborhood intersection. J. Graph Theory 18, 497-513 (1994)
78. Chvátal, V.: Tough graphs and hamiltonian circuits. Discrete Math. 5, 215-228 (1973)
79. Chvátal, V.: Hamiltonian cycles. In: E.L. Lawler, et al.: The Traveling Salesman Problem, John Wiley & Sons Ltd. 1985
80. Chvátal, V., Erdös, P.: A note on hamiltonian circuits. Discrete Math. 2, 111-113 (1972)
81. Cooper, C.: Pancyclic hamilton cycles in random graphs. Discrete Math. 91, 141-148 (1991)
82. Cooper, C.: 1-Pancyclic hamilton cycles in random graphs. Random Struct. Algorithms 3, 277-287 (1992)
83. Cooper, C.: The union of two random permutations does not have a directed hamiltonian cycle. Random Struct. Algorithms 18, 95-98 (2001)
84. Cooper, C., Frieze, A.M.: Hamilton cycles in a class of random directed graphs. J. Comb. Theory, Ser. B 62, 151-163 (1994)
85. Cooper, C., Frieze, C.M.: Hamilton cycles in random graphs and directed graphs. Random Struct. Algorithms 16, 369-401 (2000)
86. Cooper, C., Frieze, A.M., Molloy, M.: Hamilton cycles in random regular digraphs. Comb. Probab. Comput. 3, 39-49 (1994)
87. Corrádi, K., Hajnal, A.: On the maximal number of independent circuits in a graph. Acta Math. Acad. Sci. Hung. 14, 423-439 (1963)
88. Curran, S.J., Gallian, J.A.: Hamiltonian cycles and paths in cayley graphs and digraphs - a survey. Discrete Math. 156, 1-18 (1996)
89. Dean, N.: Which graphs are pancyclic modulo k. Graph theory, combinatorics, and applications, Vol. 1 (Kalamazoo, MI 1988, pp. 315-325) New York: Wiley 1991
90. Deogun, J.S., Kratsch, D., Steiner, G.: 1-Tough cocomparability graphs are hamiltonian. Discrete Math. 170, 99-106 (1997)
91. Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and the hamiltonian theme. In: Chartrand, et al.: The Theory and Applications of Graphs, (pp. 297-316) 1981
92. Dirac, G.A.: Some theorems on abstract graphs. Proc. Lond. Math. Soc. 2, 69-81 (1952)
93. Egawa, Y.: Edge-disjoint hamiltonian cycles in graphs of Ore type. SUT J. Math. 29, 15-50 (1993)
94. Ellingham, M.N., Zha, X., Zhang, Y.: Spanning 2-trails from degree sum conditions. (preprint)
95. El-Zahar, M.H.: On circuits in graphs. Discrete Math. 50, 227-230 (1984)
96. Enomoto, H., Jackson, B., Katerinis, P., Saito, A.: Toughness and the existence of k-factors. J. Graph Theory 9, 87-95 (1985)
97. Enomoto, H., Kaneko, A., Kouider, M., Tuza, Zs.: Degree sums and covering cycles. J. Graph Theory 20, 419-422 (1995)
98. 3-factors and covering cycles in graphs of minimum degree n/3. Colloq. Math. Soc. János Bolyai 52. Combinatorics, pp. 213-220, Eger (Hungary): North Holland 1988
99. Entringer, R., Schmeichel, E.: Edge conditions and cycle structure in bipartite graphs. Ars Comb. 26, 229-232 (1988)
100. Entringer, R., Swart, H.: Spanning cycles of nearly cubic graphs. J. Comb. Theory, Ser. B 29, 303-309 (1980)
101. Erdös, P.: Problem 9. In: M. Fielder: Graph Theory and its applications, pp. 159, Prague: Czech. Acad. Sci. Publ. 1964
102. Erdös, P.: Some recent combinatorial problems. Technical Report, University of Bielefeld 1990
103. Erdös, P., Gallai, T.: On maximal paths and circuits. Acta Math. Sci. Hung. 10, 337-356 (1959)
104. Erdös, P., Lovász, L.: Problems and results on 3-chromatic hypergraphs and some related questions. Colloq. Math. Soc. János Bolyai 10, 609-627 (1973)
105. Fan, G.H.: New sufficient condition for cycles in graphs. J. Comb. Theory, Ser. B 37, 221-227 (1984)
106. Fan, C., Liu, J.: Hamiltonian decompositions of strong products. J. Graph Theory 29, 45-55 (1998)
107. Fan, G.H., Häggkvist, R.: The square of a hamiltonian cycle. SIAM J. Discrete Math. 7, 203-212 (1994)
108. Fan, G.H., Kierstead, H.: The square of paths and cycles. J. Comb. Theory, Ser. B 63, 55-64 (1995)
109. Fan, G.H., Kierstead, H.: Partitioning a graph into two square - cycles. J. Graph Theory 23, 241-256 (1996)
110. Fan, G.H., Kierstead, H.: Hamiltonian square paths. J. Comb. Theory, Ser. B 67, 167-182 (1996)
111. Fassbender, B.: A sufficient condition on degree sums of independent triples for hamiltonian cycles in l-tough graphs. Ars Comb. 33, 300-304 (1992)
112. Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for hamiltonian properties. Discrete Math. 173, 45-60 (1997)
113. Faudree, R.J., Gould, R., Jacobson, M.S.: Forbidden triples implying hamiltonicity: for all graphs, (preprint)
114. Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: On k-ordered graphs. J. Graph Theory 35, 69-82 (2000)
115. Faudree, J.R., Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Variations of pancyclic graphs, (preprint)
116. Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L.: Characterizing forbidden clawless triples implying hamiltonian graphs. Discrete Math. 249, 71-81 (2002)
117. Faudree, R.J., Gould, R.J., Jacobson, M.S., Lesniak, L., Saito, A.: Toughness, degrees and 2-factors. (preprint)
118. Faudree, R.J., Gould, R.J., Jacobson, M.S., Schelp, R.: Seymour's Conjecture. In: V.R. Kulli: Advances in Graph Theory, pp. 163-171, Gulbarga: Vishwa 1991
119. Faudree, R.J., Gould, R.J., Kostochka, A., Lesniak, L., Schiermeyer, I., Saito, A.: Degree conditions for k-ordered hamiltonian graphs, (preprint)
120. Faudree, R.J., Gould, R.J., Lesniak, L., Lindquester, T.: Generalized degree conditions for graphs with bounded independence number. J. Graph Theory 19, 397-409 (1995)
121. Faudree, R.J., Gould, R.J, Ryjáček, Z., Schiermeyer, I.: Forbidden subgraphs and pancyclicity. Proc. Twenty-sixth Southeastern Conf. Comb. Graph Theory and Computing (Boca Raton, FL 1995) Congr. Numerantium 109, 13-32 (1995)
122. Faudree, R.J., Häggkvist, R., Schelp, R.: Pancyclic graphs - connected ramsey numbers. Ars Comb. 11, 37-49 (1981)
123. Faudree, R.J., Rousseau, C., Schelp, R.: Edge disjoint hamiltonian cycles. Graph theory with Applications to Algorithms and Computer Science (Kalamazoo, MI. pp. 231-249, 1984), New York: Wiley 1985
124. Faudree, R.J., Ryjáček, Z., Schiermeyer, I.: Forbidden subgraphs and cycle extendability. J. Comb. Math. Comb. Comput. (to appear)
125. Faudree, R.J., van den Heuvel, J.: Degree sums, k-factors and Hamilton cycles in graphs. Graphs Comb. 11, 21-28 (1995)
126. Flandrin, E., Jung, H.A., Li, H.: Hamiltonism, degree sum and neighborhood intersection. Discrete Math. 90, 41-52 (1991)
127. Favaron, E., Flandrin, E., Li, H., Liu, Y.P., Tian, F.: Sequences, claws and cyclability. J. Graph Theory 21, 357-369 (1996)
128. Favaron, O., Flandrin, E., Li, H., Ryjáček, Z.: Clique covering and degree conditions for hamiltonicity in claw-free graphs. Discrete Math. 236, 65-80 (2001)
129. Fleischner, H., Stiebitz, M.: A solution to a coloring problem. Discrete Math. 101, 39-48 (1992)
130. Fournier, I.: Thèse d'Etat, LRI, Université de Paris-Sud, France 1985
131. Frieze, A.M.: On matchings and Hamilton cycles in random graphs. Surveys in combinatorics, 1989 (Norwich, 1989, pp. 84-114), Lond. Math. Soc. Lect. Notes Ser. 141, Cambridge: Cambridge University Press 1989
132. Frieze, A.: Hamilton cycles in the union of random permutations. Random Struct. Algorithms 18, 83-94 (2001)
133. Frieze, A.M., Jerrum, M., Molloy, M., Robinson, R., Wormald, N.: Generating and counting hamilton cycles in random regular graphs. J. Algorithms 21, 176-198 (1996)
134. Frieze, A., Karoński, M., Thoma, L.: On perfect matchings and hamilton cycles in sums of random trees. SIAM J. Discrete Math. 12, 208-216 (1999)
135. Frieze, A., Łuczak, T.: Hamiltonian cycles in a class of random graphs: one step further. Random Graphs '87 (Poznanń, 1987, pp. 53-59), Chichester: Wiley 1990
136. Frieze, A., McDiarmid, C., Reed, B.: On a conjecture of Bondy and Fan. Ars Comb. 33, 329-336 (1992)
137. Gould, R.J.: Updating the hamiltonian problem - a survey. J. Graph Theory 15, 121-157(1991)
138. Gould, R.J., Jacobson, M.S., Lesniak, L.: Bipartite versions of two pancyclic results, (preprint)
139. Gould, R.J., Łuczak, T., Pfender, F.: Pancyclicity of 3-connected graphs: pairs of forbidden subgraphs. (preprint)
140. Gould, R.J., Hynds, E.: A note on cycles in 2-factors of line graphs. Bull. Inst. Comb. Appl. 26, 46-48 (1999)
141. Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and hamiltonian properties of graphs. Discrete Math. 42, 189-196 (1982)
142. Grunbaum, B., Malkevitch, J.: Pairs of edge-disjoint hamiltonian circuits. Aequationes Math. 14, 191-196 (1976)
143. Hajnal, A., Szemerédi, E.: Proof of a conjecture of Erdös. In: P. Erdös, A., Renyi and V.T. Sos: Combinatorial Theory and its Applications Vol II, (Colloq. Math. Soc. János Bolyai 4, pp. 601-623) Amsterdam: North Holland 1970
144. Harary, F., Nash-Williams, C. St. J.A.: On eulerian and hamiltonian graphs and line graphs. Can. Math. Bull. 701-710 (1965)
145. Harkat-Benhamdine, A., Li, H., Tian, F.: Cyclability of 3-connected graphs. J. Graph Theory 34, 191-203 (2000)
146. Hendry, G.R.T.: Extending cycles in graphs. Discrete Math. 85, 59-72 (1990)
147. Hilbig, F.: Kantenstrukturen in nichthamiltonschen graphen. Ph.D. Thesis, Technische Universität Berlin 1986
148. Hoa, V.D.: Long cycles and neighborhood unions in l-tough graphs with large degree sums. Discuss. Math. Graph Theory 18, 5-13 (1998)
149. Hoa, V.D.: A sharp lower bound for the circumference of l-tough graphs with large degree sums. J. Graph Theory 20, 137-140 (1995)
150. Hoa, V.D.: Long cycles and neighborhood union in l-tough graphs with large degree sums. Discuss. Math Graph Theory 18, 5-13 (1998)
151. Horak, P., Rosa, A.: Decomposing Steiner triple systems in a small configurations. Ars Comb. 26, 91-105 (1988)
152. Horak, P., Stacho, L.: A lower bound on the number of hamiltonian cycles. Discrete Math. 222, 275-280 (2000)
153. Hynds, E.: On the structure of 2-factors in line graphs. Ph.D. Thesis, Emory University 2000
154. Jackson, B.: Edge-disjoint hamiltonian cycles in regular graphs of large degree. J. Lond. Math. Soc., Ser. II 19, 13-16 (1979)
155. Jackson, B.: Hamilton cycles in regular 2-connected graphs. J. Comb. Theory, Ser. B 29, 27-46 (1980)
156. Jackson, B.: Neighborhood unions and hamiltonian graphs. J. Graph Theory 15, 443-451 (1991)
157. Jackson, B., Li, H., Zhu, Y.: Dominating cycles in regular 3-connected graphs. Discrete Math. 102, 163-176 (1991)
158. Jackson, B., Whitty, R.W.: A note concerning graphs with unique f-factors. J. Graph Theory 13, 577-580 (1989)
159. Jaeger, F.: The l-factorization of some line graphs. Discrete Math. 43, 199-206 (1983)
160. Janson, S.: The numbers of spanning trees, hamilton cycles and perfect matchings in a random graph. Comb. Probab. Comput. 3, 97-126 (1994)
161. Janson, S.: Random regular graphs: asymptotic distributions and contiguity. Comb. Probab. Comput. 4, 369-405 (1995)
162. Janson, S.: Hamilton cycles in a random tournament. Random Struct. Algorithms 6, 213-219 (1995)
163. Janson, S., Luczak, T., Rucinski, A.: Random Graphs. In: Discrete Mathematics and Optimization, New York: John Wiley & Sons 2000
164. Jha, P.K.: Hamiltonian decompositions of products of cycles. Indian J. Pure Appl. Math. 23, 723-729 (1992)
165. Jung, H.A.: Eine Verallgemeinrung des n-fachen Zusammenhangs für Graphen. Math. Ann. 187, 95-103 (1970)
166. Jung, H.A., Wittmann, P.: Longest cycles in tough graphs. J. Graph Theory 31, 107-127 (1999)
167. Kaneko, A., Yoshimoto, K.: On a hamiltonian cycle in which specified vertices are uniformly distributed. J. Comb. Theory, Ser. B 81, 100-109 (2001)
168. Kiel, J.M.: Finding hamiltonian circuits in interval graphs. Inf. Process. Lett. 20, 201-206 (1985)
169. Kim, J.H., Wormald, N.: Random matchings which induce hamilton cycles and hamiltonian decompositions of random regular graphs. J. Comb. Theory, Ser. B 81, 20-44 (2001)
170. Kierstead, H., Sárközy, G., Selkow, S.: On k-ordered hamiltonian graphs. J. Graph Theory 32, 17-25 (1999)
171. Kierstead, H., Quintana, J.: Square hamiltonian cycles in graphs with maximal 4-cliques. Discrete Math. 178, 81-92 (1998)
172. Komlós, J., Sárközy, G.N., Szemerédi, E.: On the Pósa-Seymour Conjecture. J. Graph Theory 29, 167-176 (1998)
173. Komlós, J., Sárközy, G.N., Szemerédi, E.: On the square of a hamiltonian cycle in dense graphs. Random Struct. Algorithms 9, 193-211 (1996)
174. Komlós, J., Sárközy, G.N., Szemerédi, E.: Proof of the Seymour conjecture for large graphs. Ann. Comb. 2, 43-60 (1998)
175. Komlós, J., Sárközy, G.N., Szemerédi, E.: Proof of the Alon-Yuster conjecture. Discrete Math. 235, 255-269 (2001)
176. Komlós, J., Sárközy, G.N., Szemerédi, E.: Blow-up lemma. Combinatorica 17, 109-123 (1997)
177. Komlós, J., Szemerédi, E.: Limit distributions for the existence of hamilton cycles in random graphs. Discrete Math. 43, 55-63 (1983)
178. Kouider, M.: Covering vertices by cycles. J. Graph Theory 18, 757-776 (1994)
179. Kouider, M., Lonc, Z.: Covering cycles and k-term degree sums. Combinatorica 16, 407-412 (1996)
180. Kratsch, D., Lehel, J., Muller, H.: Toughness, hamiltonicity and split graphs. Discrete Math. 150, 231-245 (1996)
181. Kriesell, M.: A note on hamiltonian cycles in lexicographic products. J. Autom. Lang. Comb. 2, 135-138 (1997)
182. Kriesell, M.: All 4-connected line graphs of claw-free graphs are hamiltonian connected. J. Comb. Theory, Ser. B 82, 306-315 (2001)
183. Kriesell, M.: A contribution to a conjecture of A. Saito. (preprint)
184. Lai, H.-J.: Every 4-connected line graph of a planar graph is hamiltonian. Graphs Comb. 10, 249-253 (1994)
185. Lesniak, L.: Neighborhood unions and graphical properties. Graph theory, combinatorics, and applications, vol. 2 (Kalamazoo, MI, 1988) pp. 783-800, New York: Wiley 1991
186. Li, G.: Edge disjoint hamilton cycles in graphs. J. Graph Theory 35, 8-20 (2000)
187. Li, H.: Edge disjoint cycles in graphs. J. Graph Theory 13, 313-322 (1989)
188. Li, H.: Circumferences in l-tough graphs. Discrete Math. 146, 145-151 (1995)
189. Li, H., Zhu, Y.J.: Edge-disjoint hamilton cycles in graphs. Graph theory and its applications: East and West (Jian, 1986) (Ann. N. Y. Acad. Sci. 576, pp. 311-322) New York: New York Acad. Sci. 1989
190. Mao-cheng, C., Li, Y., Kano, M.: A [k,k + 1]-factor containing a given hamiltonian cycle. Electron. J. Comb. 6, (1999)
191. Martin, P.: Cycles hamiltoniens dans les graphes 4-reguliers 4-connexes. Aequationes Math. 14, 37-40 (1976)
192. 1,3-free graphs. J. Graph Theory 9, 269-277 (1985)
193. Meredith, G.H.J., Lloyd, E.K.: The footballers of Croam. J. Comb. Theory, Ser. B 15, 161-166 (1973)
194. Mitchem, J., Schmeichel, E.: Pancyclic and bipancyclic graphs - a survey. Graphs and Applications (Boulder, CO 1982) pp. 271-287, New York: Wiley 1985
195. Nash-Williams, C. St. J.A.: Hamiltonian arcs and circuits. Recent Trends in Graph Theory Lect. Notes Math. 185, pp. 197-210, Springer Verlag 1971
196. Nash-Williams, C. St. J.A.: Combinatorial mathematics and its applications. (Oxford, 1969) pp. 191-200, London: Academic Press
197. Ng, L.: Hamiltonian decompositions of lexicographic products of digraphs. J. Comb. Theory, Ser. B 73, 119-129 (1998)
198. Ng, L., Schultz, M.: k-Ordered hamiltonian graphs. J. Graph Theory 1, 45-57 (1997)
199. Ore, O.: A note on hamiltonian circuits. Am. Math. Mon. 67, 55 (1960)
200. Owens, P.J.: Non-hamiltonian maximal planar graphs with high toughness. Cycles and colourings '97 (Statá Lesná) Tatra Mt. Math. Publ. 18, 89-103 (1999)
201. Ota, K.: Cycles through prescribed vertices with large degree sum. Discrete Math. 145, 201-210 (1995)
202. Palmer, E.: When do almost all graphs have connectivity exceeding independence number? Graph Theory, combinatorics, and algorithms, vol 1,2 (Kalamazoo, MI, 1992) pp. 851-856, New York: Wiley 1995
203. Pike, D.: Hamilton decompositions of block-intersection graphs of Steiner triple systems. Ars Comb. 51, 143-148 (1999)
204. Pike, D.: Hamilton decompositions of line graphs of perfectly 1-factorizable graphs of even degree. Aust. J. Comb. 12, 291-294 (1995)
205. Pike, D.: Hamilton decompositions of some line graphs. J. Graph Theory 20, 413-419 (1995)
206. Polický, I.: A sufficient condition for hamiltonian graphs. Math. Slovaca 45, 115-119 (1995)
207. Randerath, B., Schiermeyer, I., Wang, H.: On quadrilaterals in a graph. Discrete Math. 203, 229-237 (1999)
208. Robinson, R.W., Wormald, N.C.: Almost all cubic graphs are hamiltonian. Random Struct. Algorithms 3, 117-125 (1992)
209. Robinson, R.W., Wormald, N.C.: Almost all regular graphs are hamiltonian. Random Struct. Algorithms 5, 363-374 (1994)
210. Robinson, R., Wormald, N.: Hamilton cycles containing randomly selected edges in random regular graphs. Random Struct. Algorithms 19, 128-147 (2001)
211. Rosenfeld, M.: Pairs of edge disjoint hamiltonian circuits in 5-connected planar graphs. Aequationes Math. 38, 50-55 (1989)
212. Ryjáček, Z.: On a closure concept in claw-free graphs. J. Comb. Theory, Ser. B 70, 217-224 (1997)
213. Ryjáček, Z., Saito, A., Schelp, R.: Claw-free graphs with complete closure. (preprint)
214. Ryjáček, Z., Schelp, R.H.: Contractability techniques as a closure concept. (preprint)
215. Saad, R.: Finding a longest alternating cycle in a 2-edge coloured complete graph is in RP. Comb. Probab. Comput. 5, 297-306 (1996)
216. Sauer, N., Spencer, J.: Edge disjoint placement of graphs. J. Comb. Theory, Ser. B 25, 295-302 (1978)
217. Stacho, L.: Old hamiltonian ideas from a new point of view. Math. Nachr. 186, 251-258 (1997)
218. Stacho, L.: A sufficient condition guaranteeing large cycles in graphs. Discrete Math. 169, 273-277 (1997)
219. Stacho, L.: Cycles through specified vertices in l-tough graphs. Ars Comb. 56, 263-269 (2000)
220. Schmeichel, E., Hakimi, S.L.: A cycle structure theorem for hamiltonian graphs. J. Comb. Theory, Ser. B 45, 99-107 (1988)
221. Seymour, P.: Problem section in Combinatorics: In: T.P. McDonough and V.C. Mavron: Proc. British Combinatorial Conference 1973, pp. 201-202, Cambridge University Press 1974
222. Shearer, J.: A property of colored complete graphs. Discrete Math. 25, 175-178 (1979)
223. Sheehan, J.: The multiplicity of hamiltonian circuits in a graph. In: M. Fiedler: Recent Advances in Graph Theory, pp. 447-480, Prague: Academia 1975
224. Shepherd, F.B.: Hamiltonicity in claw-free graphs. J. Comb. Theory, Ser. B 53, 173-194 (1991)
225. Shi, R.: The Ore-type conditions on pancyclism of hamiltonian graphs. J. Syst. Sci. Math. Sci. 11, 79-90 (1991)
226. Shi, R.: 2-Neighborhoods and hamiltonian conditions. J. Graph Theory 16, 267-271 (1992)
227. Song, Z.M.: Degrees, neighborhood unions and hamiltonian properties. Ars Comb. 34, 205-211 (1992)
228. Song, Z.M., Zhang, K.M.: Neighborhood unions and hamiltonian properties. Discrete Math. 133, 319-324 (1994)
229. Stong, R.: Hamilton decompositions of cartesian products of graphs. Discrete Math. 90, 169-190 (1991)
230. Szemerédi, E.: Regular partitions of graphs. Colloq. Int. CNRS no. 260, pp. 399-401, Problemes Combinatoires et Theorie des Graphes, Orsay 1976
231. Thomason, A.G.: Hamiltonian cycles and uniquely edge colourable graphs. Ann. Discrete Math. 3, 259-268 (1978)
232. Thomassen, C.: Reflections on graph theory. J. Graph Theory 10, 309-324 (1986)
233. Thomassen, C.: Independent dominating sets and a second hamiltonian cycle in regular graphs. J. Comb. Theory, Ser. B 72, 104-109 (1998)
234. Thomassen, C.: Chords of longest cycles in cubic graphs. J. Comb. Theory, Ser. B 71, 211-214 (1997)
235. Thomassen, C.: On the number of hamiltonian cycles in bipartite graphs. Comb. Probab. Comput. 5, 437-442 (1996)
236. Tian, F., Zang, W.: Bipancyclism in hamiltonian bipartite graphs. J. Syst. Sci. Math. Sci. (English Series) 2, 22-31 (1989)
237. Tutte, W. T.: A theorem on planar graphs. Trans. Am. Math. Soc. 82, 99-116 (1956)
238. Tutte, W. T.: On hamiltonian circuits. J. Lond. Math. Soc. 21, 98-101 (1946)
239. van Blanken, E., van den Heuvel, J., Veldman, H.J.: Pancyclicity of hamiltonian line graphs. Discrete Math. 138, 379-385 (1995)
240. Wei, B.: Hamiltonian cycles in l-tough graphs. Graphs Comb. 12, 385-395 (1996)
241. Wei, B., Zhu, Y.: Hamiltonian k-factors in graphs. J. Graph Theory 25, 217-227 (1997)
242. Witte, D., Gallian, J.A.: A survey-Hamiltonian cycles in Cayley graphs. Discrete Math. 51, 293-304 (1984)
243. Xiong, L.: Edge degree conditions for subpancyclicity in line graphs. Discrete Math. 188, 225-232 (1998)
244. Zaks, J.: Pairs of hamiltonian circuits in 5-connected planar graphs. J. Comb. Theory, Ser. B 21, 116-131 (1976)
245. Zhan, S.: Hamiltonian connectedness of line graphs. Ars Comb. 22, 89-95 (1986)
246. Zhang, S.M.: Pancyclism and bipancyclism of hamiltonian graphs. J. Comb. Theory, Ser. B 60, 159-168 (1994)
247. Zhang, S., Li, X., Broersma, H.: Heavy paths and cycles in weighted graphs. Discrete Math. 223, 327-336 (2000)
248. Zhou, M.: Decomposition of some product graphs into 1-factors and hamiltonian cycles. Ars Comb. 28, 258-268 (1989)