{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:55:01Z","timestamp":1781463301358,"version":"3.54.1"},"reference-count":24,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T00:00:00Z","timestamp":1790812800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003819","name":"Hubei Province Natural Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003819","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013804","name":"Fundamental Research Funds for the Central Universities","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100013804","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2026,10]]},"DOI":"10.1016\/j.dam.2026.04.040","type":"journal-article","created":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T11:14:45Z","timestamp":1778670885000},"page":"108-113","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The maximum size of a nonhamiltonian-connected graph with given order and minimum degree"],"prefix":"10.1016","volume":"391","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0783-4820","authenticated-orcid":false,"given":"Leilei","family":"Zhang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.dam.2026.04.040_b1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/0095-8956(71)90016-5","article-title":"Pancyclic graphs I","volume":"11","author":"Bondy","year":"1971","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.04.040_b2","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4153\/CMB-1972-012-3","article-title":"Variations on the hamiltonian theme","volume":"15","author":"Bondy","year":"1972","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/j.dam.2026.04.040_b3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(76)90078-9","article-title":"A method in graph theory","volume":"15","author":"Bondy","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.040_b4","first-page":"227","article-title":"Remarks on a paper of p\u00f3sa","volume":"7","author":"Erd\u0151s","year":"1962","journal-title":"Magy. Tud. Akad. Math. Kutat\u00d3. Int. K\u00f6zl."},{"key":"10.1016\/j.dam.2026.04.040_b5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.dam.2026.04.040_b6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.aml.2009.03.025","article-title":"On the extremal number of edges in hamiltonian connected graphs","volume":"23","author":"Ho","year":"2010","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/j.dam.2026.04.040_b7","first-page":"1659","article-title":"On the extremal number of edges in Hamiltonian graphs","volume":"27","author":"Ho","year":"2011","journal-title":"J. Inf. Sci. Eng."},{"key":"10.1016\/j.dam.2026.04.040_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.112908","article-title":"A note on the 2-power of Hamilton cycles","volume":"345","author":"Khan","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.040_b9","first-page":"19","article-title":"Maximal paths and cycles in a graph","volume":"234","author":"Kopylov","year":"1977","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/j.dam.2026.04.040_b10","doi-asserted-by":"crossref","first-page":"2252","DOI":"10.1080\/03081087.2016.1151854","article-title":"Spectral analogues of erd\u0151s and moon-moser\u2019s theorems on hamiltoncycles","volume":"64","author":"Li","year":"2016","journal-title":"Linear Multilinear Algebra"},{"key":"10.1016\/j.dam.2026.04.040_b11","doi-asserted-by":"crossref","first-page":"2774","DOI":"10.1016\/j.disc.2018.06.023","article-title":"Extremal problems on the hamiltonicity of claw-free graphs","volume":"341","author":"Li","year":"2018","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.040_b12","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1016\/S0021-9800(70)80037-0","article-title":"A sufficient condition for hamiltonian connectedness","volume":"8","author":"Lick","year":"1970","journal-title":"J. Comb. Theory"},{"key":"10.1016\/j.dam.2026.04.040_b13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1002\/jgt.22907","article-title":"Hamilton-connected {claw, net}-free graphs","volume":"103","author":"Liu","year":"2023","journal-title":"II, J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.040_b14","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF02412090","article-title":"Arc coverings of graphs","volume":"55","author":"Ore","year":"1961","journal-title":"Ann. Mat. Pura Appl."},{"key":"10.1016\/j.dam.2026.04.040_b15","first-page":"21","volume":"42","author":"Ore","year":"1963","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/j.dam.2026.04.040_b16","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0012-365X(94)00036-I","article-title":"Cycles through prescribed vertices with large degree sum","volume":"145","author":"Ota","year":"1995","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.040_b17","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(74)90043-4","article-title":"Pancyclic graphs and a conjecture of bondy and chv\u00e1tal","volume":"17","author":"Schmeichel","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/j.dam.2026.04.040_b18","series-title":"Introduction To Graph Theory","author":"West","year":"1996"},{"key":"10.1016\/j.dam.2026.04.040_b19","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.dam.2023.06.009","article-title":"Some sufficient conditions for graphs being k-leaf-connected","volume":"339","author":"Wu","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.dam.2026.04.040_b20","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1002\/jgt.22246","article-title":"Extensions of a theorem of Erd\u0151s on nonhamiltonian graphs","volume":"89","author":"Z.\u00a0F\u00fcredi","year":"2018","journal-title":"J. Graph Theory"},{"key":"10.1016\/j.dam.2026.04.040_b21","doi-asserted-by":"crossref","DOI":"10.1016\/j.disc.2022.113159","article-title":"The maximum degree of a minimally hamiltonian-connected graph","volume":"345","author":"Zhan","year":"2022","journal-title":"Discrete Math."},{"key":"10.1016\/j.dam.2026.04.040_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.ejc.2023.103728","article-title":"The maximum number of cliques in graphs with prescribed order, circumference and minimum degree","volume":"112","author":"Zhang","year":"2023","journal-title":"European J. Combin."},{"key":"10.1016\/j.dam.2026.04.040_b23","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.laa.2020.06.012","article-title":"On sufficient spectral radius conditions for hamiltonicity of k-connected graphs","volume":"604","author":"Zhou","year":"2020","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/j.dam.2026.04.040_b24","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1080\/03081087.2016.1182463","article-title":"Some sufficient spectral conditions on hamilton-connected and traceable graphs","volume":"65","author":"Zhou","year":"2017","journal-title":"Linear Multilinear Algebra"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002684?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X26002684?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,14]],"date-time":"2026-06-14T18:07:31Z","timestamp":1781460451000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X26002684"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,10]]},"references-count":24,"alternative-id":["S0166218X26002684"],"URL":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.040","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2026,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The maximum size of a nonhamiltonian-connected graph with given order and minimum degree","name":"articletitle","label":"Article Title"},{"value":"Discrete Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dam.2026.04.040","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}]}}