{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:16:31Z","timestamp":1781259391141,"version":"3.54.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030307851","type":"print"},{"value":"9783030307868","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30786-8_3","type":"book-chapter","created":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T17:22:57Z","timestamp":1568222577000},"page":"27-39","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Hamiltonicity Below Dirac\u2019s Condition"],"prefix":"10.1007","author":[{"given":"Bart M. P.","family":"Jansen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L\u00e1szl\u00f3","family":"Kozma","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jesper","family":"Nederlof","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,9,12]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/s00224-007-1328-0","volume":"41","author":"FN Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N., Fellows, M.R., Langston, M.A., Suters, W.H.: Crown structures for vertex cover kernelization. Theory Comput. Syst. 41(3), 411\u2013430 (2007). \n                    https:\/\/doi.org\/10.1007\/s00224-007-1328-0","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"3_CR2","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/s00453-010-9428-7","volume":"61","author":"N Alon","year":"2011","unstructured":"Alon, N., Gutin, G., Kim, E.J., Szeider, S., Yeo, A.: Solving MAX-r-SAT above a tight lower bound. Algorithmica 61(3), 638\u2013655 (2011). \n                    https:\/\/doi.org\/10.1007\/s00453-010-9428-7","journal-title":"Algorithmica"},{"issue":"4","key":"3_CR3","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995). \n                    https:\/\/doi.org\/10.1145\/210332.210337","journal-title":"J. ACM"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/321105.321111","volume":"9","author":"R Bellman","year":"1962","unstructured":"Bellman, R.: Dynamic programming treatment of the travelling salesman problem. J. Assoc. Comput. Mach. 9, 61\u201363 (1962)","journal-title":"J. Assoc. Comput. Mach."},{"key":"3_CR5","doi-asserted-by":"publisher","unstructured":"Bez\u00e1kov\u00e1, I., Curticapean, R., Dell, H., Fomin, F.V.: Finding detours is fixed-parameter tractable. In: Proceedings of 44th ICALP. pp. 54:1\u201354:14 (2017). \n                    https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2017.54","DOI":"10.4230\/LIPIcs.ICALP.2017.54"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1137\/110839229","volume":"43","author":"A Bj\u00f6rklund","year":"2014","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected Hamiltonicity. SIAM J. Comput. 43(1), 280\u2013299 (2014). \n                    https:\/\/doi.org\/10.1137\/110839229","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","volume":"15","author":"JA Bondy","year":"1976","unstructured":"Bondy, J.A., Chv\u00e1tal, V.: A method in graph theory. Discrete Math. 15(2), 111\u2013135 (1976)","journal-title":"Discrete Math."},{"key":"3_CR8","unstructured":"Bondy, J.: Longest Paths and Cycles in Graphs of High Degree. Research report, Department of Combinatorics and Optimization, University of Waterloo (1980)"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1016\/j.dam.2017.01.011","volume":"252","author":"Y B\u00fcy\u00fck\u00e7olak","year":"2019","unstructured":"B\u00fcy\u00fck\u00e7olak, Y., G\u00f6z\u00fcpek, D., \u00d6zkan, S., Shalom, M.: On one extension of Dirac\u2019s theorem on Hamiltonicity. Discrete Appl. Math. 252, 10\u201316 (2019). \n                    https:\/\/doi.org\/10.1016\/j.dam.2017.01.011","journal-title":"Discrete Appl. Math."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-540-30559-0_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Benny Chor","year":"2004","unstructured":"Chor, B., Fellows, M., Juedes, D.W.: Linear kernels in linear time, or how to save \n                    \n                      \n                    \n                    $$k$$\n                   colors in \n                    \n                      \n                    \n                    $$O$$\n                  \n                    \n                      \n                    \n                    $$(n^2)$$\n                   steps. In: Proceedings of 30th WG, pp. 257\u2013269 (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-30559-0_22"},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"734","DOI":"10.1007\/s00453-014-9870-z","volume":"72","author":"R Crowston","year":"2015","unstructured":"Crowston, R., Jones, M., Mnich, M.: Max-cut parameterized above the Edwards-Erd\u0151s bound. Algorithmica 72(3), 734\u2013757 (2015). \n                    https:\/\/doi.org\/10.1007\/s00453-014-9870-z","journal-title":"Algorithmica"},{"key":"3_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). \n                    https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"3","key":"3_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jagm.1993.1046","volume":"15","author":"E Dahlhaus","year":"1993","unstructured":"Dahlhaus, E., Hajnal, P., Karpinski, M.: On the parallel complexity of Hamiltonian cycle and matching problem on dense graphs. J. Algorithms 15(3), 367\u2013384 (1993). \n                    https:\/\/doi.org\/10.1006\/jagm.1993.1046","journal-title":"J. Algorithms"},{"key":"3_CR14","series-title":"Graduate Texts in Mathematics","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012)","edition":"4"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1112\/plms\/s3-2.1.69","volume":"2","author":"GA Dirac","year":"1952","unstructured":"Dirac, G.A.: Some theorems on abstract graphs. Proc. London Math. Soc. s3 2(1), 69\u201381 (1952). \n                    https:\/\/doi.org\/10.1112\/plms\/s3-2.1.69","journal-title":"Proc. London Math. Soc. s3"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-39890-5_1","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"MR Fellows","year":"2003","unstructured":"Fellows, M.R.: Blow-Ups, Win\/Win\u2019s, and crown rules: some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1\u201312. Springer, Heidelberg (2003). \n                    https:\/\/doi.org\/10.1007\/978-3-540-39890-5_1"},{"key":"3_CR17","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-29953-X","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. TTCSAES. Springer, Heidelberg (2006). \n                    https:\/\/doi.org\/10.1007\/3-540-29953-X"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-013-1377-x","volume":"30","author":"RJ Gould","year":"2014","unstructured":"Gould, R.J.: Recent advances on the Hamiltonian problem: survey III. Graphs Comb. 30(1), 1\u201346 (2014). \n                    https:\/\/doi.org\/10.1007\/s00373-013-1377-x","journal-title":"Graphs Comb."},{"key":"3_CR19","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-28639-4_15","volume-title":"Parameterized and Exact Computation","author":"Jiong Guo","year":"2004","unstructured":"Guo, J., H\u00fcffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Proceedings of 1st IWPEC, pp. 162\u2013173 (2004). \n                    https:\/\/doi.org\/10.1007\/978-3-540-28639-4_15"},{"issue":"2","key":"3_CR20","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/s00224-010-9262-y","volume":"48","author":"GZ Gutin","year":"2011","unstructured":"Gutin, G.Z., Kim, E.J., Lampis, M., Mitsou, V.: Vertex cover problem parameterized above and below tight bounds. Theory Comput. Syst. 48(2), 402\u2013410 (2011). \n                    https:\/\/doi.org\/10.1007\/s00224-010-9262-y","journal-title":"Theory Comput. Syst."},{"issue":"2","key":"3_CR21","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1016\/j.jcss.2010.06.001","volume":"77","author":"GZ Gutin","year":"2011","unstructured":"Gutin, G.Z., Kim, E.J., Szeider, S., Yeo, A.: A probabilistic approach to problems parameterized above or below tight bounds. J. Comput. Syst. Sci. 77(2), 422\u2013429 (2011). \n                    https:\/\/doi.org\/10.1016\/j.jcss.2010.06.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"3_CR22","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1137\/140980946","volume":"30","author":"GZ Gutin","year":"2016","unstructured":"Gutin, G.Z., Patel, V.: Parameterized traveling salesman problem: beating the average. SIAM J. Discrete Math. 30(1), 220\u2013238 (2016). \n                    https:\/\/doi.org\/10.1137\/140980946","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"3_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S0963548300000055","volume":"1","author":"R H\u00e4ggkvist","year":"1992","unstructured":"H\u00e4ggkvist, R.: On the structure of non-Hamiltonian graphs I. Comb. Probab. Comput. 1(1), 27\u201334 (1992). \n                    https:\/\/doi.org\/10.1017\/S0963548300000055","journal-title":"Comb. Probab. Comput."},{"key":"3_CR24","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held, M., Karp, R.M.: A dynamic programming approach to sequencing problems. J. Soc. Indust. Appl. Math. 10, 196\u2013210 (1962). \n                    https:\/\/doi.org\/10.1137\/0110015","journal-title":"J. Soc. Indust. Appl. Math."},{"issue":"4","key":"3_CR25","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001). \n                    https:\/\/doi.org\/10.1006\/jcss.2001.1774","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR26","unstructured":"Jansen, B.M.P., Kozma, L., Nederlof, J.: Hamiltonicity below Dirac\u2019s condition. CoRR abs\/1902.01745 (2019). \n                    http:\/\/arxiv.org\/abs\/1902.01745"},{"key":"3_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W., Bohlinger, J.D. (eds.) IRSS, pp. 85\u2013103. Springer, Heidelberg (1972). \n                    https:\/\/doi.org\/10.1007\/978-1-4684-2001-2_9"},{"issue":"2","key":"3_CR28","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0167-6377(82)90044-X","volume":"1","author":"RM Karp","year":"1982","unstructured":"Karp, R.M.: Dynamic programming meets the principle of inclusion and exclusion. Oper. Res. Lett. 1(2), 49\u201351 (1982). \n                    https:\/\/doi.org\/10.1016\/0167-6377(82)90044-X","journal-title":"Oper. Res. Lett."},{"key":"3_CR29","unstructured":"Knuth, D.: The art of computer programming: updates; pre-fascicle 8A, A draft of section 7.2.2.4: Hamiltonian paths and cycles. In: Addison-Wesley Series in Computer Science and Information Proceedings, vol. 4. Addison-Wesley (2018). \n                    https:\/\/www-cs-faculty.stanford.edu\/~knuth\/fasc8a.ps.gz"},{"key":"3_CR30","unstructured":"K\u00fchn, D., Osthus, D.: Hamilton cycles in graphs and hypergraphs: an extremal perspective. CoRR abs\/1402.4268 (2014). \n                    http:\/\/arxiv.org\/abs\/1402.4268"},{"key":"3_CR31","volume-title":"The Traveling Salesman Problem","author":"E Lawler","year":"1985","unstructured":"Lawler, E., Shmoys, D., Kan, A., Lenstra, J.: The Traveling Salesman Problem. Wiley, Hoboken (1985)"},{"issue":"19","key":"3_CR32","doi-asserted-by":"publisher","first-page":"2034","DOI":"10.1016\/j.disc.2012.11.025","volume":"313","author":"H Li","year":"2013","unstructured":"Li, H.: Generalizations of Dirac\u2019s theorem in Hamiltonian graph theory-a survey. Discrete Math. 313(19), 2034\u20132053 (2013). \n                    https:\/\/doi.org\/10.1016\/j.disc.2012.11.025","journal-title":"Discrete Math."},{"issue":"2","key":"3_CR33","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1006\/jagm.1998.0996","volume":"31","author":"M Mahajan","year":"1999","unstructured":"Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. J. Algorithms 31(2), 335\u2013354 (1999). \n                    https:\/\/doi.org\/10.1006\/jagm.1998.0996","journal-title":"J. Algorithms"},{"issue":"2","key":"3_CR34","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137\u2013153 (2009). \n                    https:\/\/doi.org\/10.1016\/j.jcss.2008.08.004","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR35","first-page":"157","volume-title":"Studies in Pure Mathematics","author":"C Nash-Williams","year":"1971","unstructured":"Nash-Williams, C.: Edge-disjoint Hamiltonian circuits in graphs with large valency. In: Mirksy, L. (ed.) Studies in Pure Mathematics, pp. 157\u2013183. Academic Press, London (1971)"},{"issue":"1","key":"3_CR36","doi-asserted-by":"publisher","first-page":"55","DOI":"10.2307\/2308928","volume":"67","author":"O Ore","year":"1960","unstructured":"Ore, O.: Note on Hamilton circuits. Am. Math. Monthly 67(1), 55 (1960). \n                    http:\/\/www.jstor.org\/stable\/2308928","journal-title":"Am. Math. Monthly"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30786-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,11]],"date-time":"2019-09-11T17:23:26Z","timestamp":1568222606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30786-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030307851","9783030307868"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30786-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"12 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WG","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Graph-Theoretic Concepts in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vall de N\u00faria","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wg2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wg2019.sau.thilikos.info\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"87","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1-2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}