{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T21:08:38Z","timestamp":1769116118938,"version":"3.49.0"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2014,4,20]],"date-time":"2014-04-20T00:00:00Z","timestamp":1397952000000},"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":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s00373-014-1416-2","type":"journal-article","created":{"date-parts":[[2014,4,19]],"date-time":"2014-04-19T05:54:53Z","timestamp":1397886893000},"page":"885-896","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Extension of the Chv\u00e1tal\u2013Erd\u0151s Theorem: Counting the Number of Maximum Independent Sets"],"prefix":"10.1007","volume":"31","author":[{"given":"Guantao","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yinkui","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haicheng","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tingzeng","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liming","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,4,20]]},"reference":[{"key":"1416_CR1","unstructured":"Ahmed, T.: A survey on the Chv\u00e1tal\u2013Erd\u0151s theorem. http:\/\/citeseerx.ist.psu.edu\/viewdoc\/download?doi=10.1.1.90.9100&rep=rep1&type=pdf"},{"key":"1416_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0012-365X(94)00002-Z","volume":"142","author":"A Ainouche","year":"1995","unstructured":"Ainouche, A.: A common generalization of Chv\u00e1tal\u2013Erd\u0151s and Fraisse\u2019s sufficient conditions for Hamiltonian graphs. Discret. Math. 142, 21\u201326 (1995)","journal-title":"Discret. Math."},{"key":"1416_CR3","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/jgt.20540","volume":"68","author":"G Chen","year":"2011","unstructured":"Chen, G., Hu, Z., Wu, Y.: Circumferences of $$k$$ k -connected graphs involving independence numbers. J. Graph Theory 68, 55\u201376 (2011)","journal-title":"J. Graph Theory"},{"key":"1416_CR4","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0012-365X(72)90079-9","volume":"2","author":"V Chv\u00e1tal","year":"1972","unstructured":"Chv\u00e1tal, V., Erd\u0151s, P.: A note on Hamiltonian circuits. Discret. Math. 2, 111\u2013113 (1972)","journal-title":"Discret. Math."},{"key":"1416_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.jctb.2003.05.002","volume":"91","author":"H Enomoto","year":"2004","unstructured":"Enomoto, H., Kaneko, A., Saito, A., Wei, B.: Long cycles in triangle-free graphs with prescribed independence number and connectivity. J. Comb. Theory Ser. B 91, 43\u201355 (2004)","journal-title":"J. Comb. Theory Ser. B"},{"key":"1416_CR6","unstructured":"Fouquet, J.L., Jolivet, J.L.: Probl $$\\acute{e}$$ e \u00b4 me 438. In: Probl $$\\acute{e}$$ e \u00b4 mes Combinatoires et Th $$\\acute{e}$$ e \u00b4 orie des Graphes. Univ. Orsay, Orsay (1976)"},{"issue":"1","key":"1416_CR7","doi-asserted-by":"crossref","first-page":"P149","DOI":"10.37236\/636","volume":"18","author":"S Fujita","year":"2011","unstructured":"Fujita, S., Halperin, A., Mangant, C.: Long path lemma concerning connectivity and independence number. Elecron. J. Comb. 18(1), P149 (2011)","journal-title":"Elecron. J. Comb."},{"key":"1416_CR8","doi-asserted-by":"crossref","first-page":"2082","DOI":"10.1016\/j.disc.2010.03.020","volume":"310","author":"L Han","year":"2010","unstructured":"Han, L., Lai, H.-J., Xiong, L., Yan, H.: The Chv\u00e1tal\u2013Erd\u0151s condition for supereulerian graphs and the Hamiltonian index. Discret. Math. 310, 2082\u20132090 (2010)","journal-title":"Discret. Math."},{"key":"1416_CR9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF01858457","volume":"12","author":"J Heuvel van den","year":"1996","unstructured":"van den Heuvel, J.: Extentions and consequences of Chv\u00e1tal\u2013Erd\u0151s theorem. Graphs Comb. 12, 231\u2013237 (1996)","journal-title":"Graphs Comb."},{"key":"1416_CR10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0012-365X(90)90130-A","volume":"84","author":"B Jackson","year":"1990","unstructured":"Jackson, B., Oradaz, O.: Chv\u00e1tal\u2013Erd\u0151s conditions for paths and cycles in graphs and digraphs, a survey. Discret. Math. 84, 241\u2013254 (1990)","journal-title":"Discret. Math."},{"key":"1416_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01375473","volume":"11","author":"V Neumann-Lara","year":"1991","unstructured":"Neumann-Lara, V., Rivera-Campo, E.: Spanning trees with bounded degrees. Combinatorica 11, 55\u201361 (1991)","journal-title":"Combinatorica"},{"key":"1416_CR12","doi-asserted-by":"crossref","unstructured":"O, S., West, D.B, Wu, H.: Longest cycles in $$k$$ k -connected graphs with given independence number. J. Comb. Theory Ser. B 101, 480\u2013485 (2011)","DOI":"10.1016\/j.jctb.2011.02.005"},{"key":"1416_CR13","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/978-3-540-89550-3_21","volume":"2535","author":"A Saito","year":"2008","unstructured":"Saito, A.: Chv\u00e1tal\u2013Erd\u0151s theorem\u2014old theorem with new aspects. Lect. Notes Comput. Sci. 2535, 191\u2013200 (2008)","journal-title":"Lect. Notes Comput. Sci."},{"key":"1416_CR14","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1416-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-014-1416-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-014-1416-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T02:17:39Z","timestamp":1597717059000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-014-1416-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,20]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["1416"],"URL":"https:\/\/doi.org\/10.1007\/s00373-014-1416-2","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,20]]}}}