{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T07:21:32Z","timestamp":1773040892803,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,5,1]],"date-time":"2009-05-01T00:00:00Z","timestamp":1241136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[2009,5]]},"DOI":"10.1007\/s00493-009-2360-2","type":"journal-article","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T05:50:52Z","timestamp":1246513852000},"page":"299-326","source":"Crossref","is-referenced-by-count":39,"title":["Hamiltonian cycles in Dirac graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Bill","family":"Cuckler","sequence":"first","affiliation":[]},{"given":"Jeff","family":"Kahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,7,3]]},"reference":[{"key":"2360_CR1","unstructured":"B. Bollob\u00e1s: Martingales, isoperimetric inequalities and random graphs, in: Combinatorics (A. Hajnal, L. Lov\u00e1sz and V. T. S\u00f3s,eds.), Colloq. Math. Soc. J\u00e1nos Bolyai 52, North Holland, 1988."},{"key":"2360_CR2","first-page":"1231","volume-title":"Handbook of Combinatorics","author":"B. Bollob\u00e1s","year":"1995","unstructured":"B. Bollob\u00e1s: Extremal graph theory, in: Handbook of Combinatorics (R. L. Graham, M. Gr\u00f6tschel, L. Lov\u00e1sz, eds.), pp. 1231\u20131292, Elsevier Science, Amsterdam, 1995."},{"key":"2360_CR3","first-page":"3","volume-title":"Handbook of Combinatorics","author":"J. A. Bondy","year":"1995","unstructured":"J. A. Bondy: Basic graph theory, in: Handbook of Combinatorics (R. L. Graham, M. Gr\u00f6tschel, L. Lov\u00e1sz, eds.), pp. 3\u2013110, Elsevier Science, Amsterdam, 1995."},{"key":"2360_CR4","first-page":"945","volume":"14","author":"L. Br\u00e9gman","year":"1973","unstructured":"L. Br\u00e9gman: Some properties of nonnegative matrices and their permanents, Math. Doklady 14 (1973), 945\u2013949.","journal-title":"Math. Doklady"},{"key":"2360_CR5","volume-title":"Information theory. Coding theorems for discrete memoryless systems","author":"I. Csisz\u00e1r","year":"1981","unstructured":"I. Csisz\u00e1r and J. K\u00f6rner: Information theory. Coding theorems for discrete memoryless systems; Akad\u00e9miai Kiad\u00f3, Budapest, 1981."},{"key":"2360_CR6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1017\/S0963548306008170","volume":"162","author":"B. Cuckler","year":"2007","unstructured":"B. Cuckler: Hamiltonian cycles in regular tournaments, Combinatorics, Probability and Computing 16(2) (2007), 239\u2013249.","journal-title":"Combinatorics, Probability and Computing"},{"key":"2360_CR7","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00493-009-2366-9","volume":"293","author":"B. Cuckler","year":"2009","unstructured":"B. Cuckler and J. Kahn: Entropy bounds for perfect matchings and Hamiltonian cycles, Combinatorica 29(3) (2009), 327\u2013335.","journal-title":"Combinatorica"},{"key":"2360_CR8","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"G. A. Dirac","year":"1952","unstructured":"G. A. Dirac: Some theorems on abstract graphs, Proceedings of the London Mathematics Society, Third Series 2 (1952), 69\u201381.","journal-title":"Proceedings of the London Mathematics Society, Third Series"},{"key":"2360_CR9","volume-title":"Probability: Theory and Examples","author":"R. Durrett","year":"1991","unstructured":"R. Durrett: Probability: Theory and Examples; Wadsworth, Belmont, 1991."},{"key":"2360_CR10","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1145\/1008731.1008738","volume":"51","author":"M. Jerrum","year":"2004","unstructured":"M. Jerrum, A. Sinclair and E. Vigoda: A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries, J. ACM 51 (2004), 671\u2013697.","journal-title":"J. ACM"},{"issue":"2","key":"2360_CR11","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/PL00009817","volume":"18","author":"J. Kahn","year":"1998","unstructured":"J. Kahn and J. H. Kim: Random matchings in regular graphs, Combinatorica 18(2) (1998), 201\u2013226.","journal-title":"Combinatorica"},{"issue":"4","key":"2360_CR12","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s004930070007","volume":"20","author":"N. Linial","year":"2000","unstructured":"N. Linial, A. Samorodnitsky and A. Wigderson: A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents, Combinatorica 20(4) (2000), 545\u2013568.","journal-title":"Combinatorica"},{"key":"2360_CR13","volume-title":"The theory of information and coding","author":"R. J. McEliece","year":"1977","unstructured":"R. J. McEliece: The theory of information and coding, Addison-Wesley, London, 1977."},{"key":"2360_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-04016-0","volume-title":"Graph colouring and the probabilistic method","author":"M. Molloy","year":"2002","unstructured":"M. Molloy and B. Reed: Graph colouring and the probabilistic method, Springer, Berlin, 2002."},{"key":"2360_CR15","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02759704","volume":"1","author":"J. Moon","year":"1963","unstructured":"J. Moon and L. Moser: On Hamiltonian bipartite graphs, Israel J. Math. 1 (1963), 163\u2013165.","journal-title":"Israel J. Math."},{"key":"2360_CR16","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"C. Nash-Williams","year":"1971","unstructured":"C. Nash-Williams: Edge-disjoint Hamiltonian circuits in graphs with vertices of large valency, in: Studies in Pure Mathematics (L. Mirsky, ed.), pp. 157\u2013183, Academic Press, London, 1971."},{"key":"2360_CR17","first-page":"21","volume":"42","author":"O. Ore","year":"1963","unstructured":"O. Ore: Hamilton connected graphs, J. Math. Pures Appl. (9) 42 (1963), 21\u201327.","journal-title":"J. Math. Pures Appl. (9)"},{"key":"2360_CR18","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0195-6698(85)80023-8","volume":"6","author":"V. R\u00f6dl","year":"1985","unstructured":"V. R\u00f6dl: On a packing and covering problem, Europ. J. Combinatorics 6 (1985), 69\u201378.","journal-title":"Europ. J. Combinatorics"},{"key":"2360_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/S0012-365X(02)00582-4","volume":"265","author":"G. S\u00e1rk\u00f6zy","year":"2003","unstructured":"G. S\u00e1rk\u00f6zy, S. Selkow and E. Szemer\u00e9di: On the number of Hamiltonian cycles in Dirac graphs, Discrete Mathematics 265 (2003), 237\u2013250.","journal-title":"Discrete Mathematics"},{"key":"2360_CR20","unstructured":"E. Szemer\u00e9di: Regular partitions of graphs, in: Probl\u00e8mes Combinatoires et Th\u00e9orie des Graphes, Orsay (1976), Colloques Internationaux CNRS 260, pp. 399\u2013401."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2360-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00493-009-2360-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00493-009-2360-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:32:46Z","timestamp":1559079166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00493-009-2360-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,5]]}},"alternative-id":["2360"],"URL":"https:\/\/doi.org\/10.1007\/s00493-009-2360-2","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5]]}}}