{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,28]],"date-time":"2022-03-28T23:39:27Z","timestamp":1648510767315},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T00:00:00Z","timestamp":1378252800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1007\/s00373-013-1354-4","type":"journal-article","created":{"date-parts":[[2013,9,3]],"date-time":"2013-09-03T09:08:37Z","timestamp":1378199317000},"page":"1499-1511","source":"Crossref","is-referenced-by-count":1,"title":["Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs"],"prefix":"10.1007","volume":"30","author":[{"given":"Xiaoling","family":"Ma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elkin","family":"Vumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,4]]},"reference":[{"key":"1354_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1016\/S0012-365X(97)00023-X","volume":"179","author":"A. Ainouche","year":"1998","unstructured":"Ainouche A.: Quasi-claw-free graphs. Discrete Math. 179, 13\u201326 (1998)","journal-title":"Discrete Math."},{"key":"1354_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0012-365X(97)00157-X","volume":"184","author":"A. Ainouche","year":"1998","unstructured":"Ainouche A., Favaron O., Li H.: Global insertion and hamiltonicity in DCT-graphs. Discrete Math. 184, 1\u201313 (1998)","journal-title":"Discrete Math."},{"key":"1354_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/0012-365X(91)90468-H","volume":"96","author":"D. Bauer","year":"1991","unstructured":"Bauer D., Fan G., Veldman H.J.: Hamiltonian properties of graphs with large neighborhood unions. Discrete Math. 96, 33\u201349 (1991)","journal-title":"Discrete Math."},{"key":"1354_CR4","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/S0012-365X(01)00325-9","volume":"251","author":"H.J. Broersma","year":"2002","unstructured":"Broersma H.J.: On some intriguing problems in hamiltonian graph theory \u2013 a survey. Discrete Math. 251, 47\u201369 (2002)","journal-title":"Discrete Math."},{"key":"1354_CR5","unstructured":"Broersma, H.J.: Hamilton cycles in graphs and related topics. Doctoral thesis, University of Twente, Enschede (1988)"},{"key":"1354_CR6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1002\/(SICI)1097-0118(199604)21:4<431::AID-JGT9>3.0.CO;2-Q","volume":"21","author":"H.J. Broersma","year":"1996","unstructured":"Broersma H.J., Ryj\u00e1\u010dek Z., Schiermeyer I.: Toughness and hamiltoncity in almost claw-free graphs. J. Graph Theory 21, 431\u2013439 (1996)","journal-title":"J. Graph Theory"},{"key":"1354_CR7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/s00186-008-0260-7","volume":"69","author":"H.J. Broersma","year":"2009","unstructured":"Broersma H.J., Vumar E.: On hamiltonicity of P 3-dominated graphs. Math. Methods Oper. Res. 69, 297\u2013306 (2009)","journal-title":"Math. Methods Oper. Res."},{"key":"1354_CR8","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1006\/jctb.2001.2039","volume":"82","author":"O. Favaron","year":"2001","unstructured":"Favaron O., Fraisse P.: Hamiltonicity and Minimum Degree in 3-connected Claw-Free Graphs. J. Combin. Theory Ser. B 82, 297\u2013305 (2001)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1354_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(89)90060-9","volume":"47","author":"R.J. Faudree","year":"1989","unstructured":"Faudree R.J., Gould R.J., Jacobson M.S., Schelp R.H.: Neighborhood Unions and Hamiltonian Properties in Graphs. J. Combin. Theory Ser. B 47, 1\u20139 (1989)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1354_CR10","unstructured":"Faudree, R.J., Gould, R.J., Lindquester, T.E.: Hamilltonian properties and adjacency conditions in K 1,3-free graphs. In: Proceedings of the 6th International Conference on Theory and Applications of Graphs, Kalamazoo (1988)"},{"key":"1354_CR11","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s00373-008-0805-9","volume":"24","author":"J. Guo","year":"2008","unstructured":"Guo J., Vumar E.: On the Circumference of 2-Connected P 3-dominated Graphs. Graphs Combin. 24, 443\u2013451 (2008)","journal-title":"Graphs Combin."},{"key":"1354_CR12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1016\/j.jctb.2005.10.003","volume":"96","author":"H.J. Lai","year":"2006","unstructured":"Lai H.J., Shao Y., Zhan M.: Hamiltonicity in 3-connected claw-free graphs. J. Combin. Theory Ser. B 96, 493\u2013504 (2006)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1354_CR13","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s003730050061","volume":"15","author":"H. Li","year":"1999","unstructured":"Li H., Chen C., Harkat-Benhamdine A.: Distance dominating cycles in quasi-claw-free graphs. Graphs Combin. 15, 279\u2013285 (1999)","journal-title":"Graphs Combin."},{"key":"1354_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s003730070024","volume":"16","author":"M. Li","year":"2000","unstructured":"Li M.: Longest cycles in almost claw-free graphs. Graphs Combin. 16, 177\u2013198 (2000)","journal-title":"Graphs Combin."},{"key":"1354_CR15","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/PL00007257","volume":"17","author":"M. Li","year":"2001","unstructured":"Li M.: Hamiltonian cycles in almost claw-free graphs. Graphs Combin. 17, 687\u2013706 (2001)","journal-title":"Graphs Combin."},{"key":"1354_CR16","doi-asserted-by":"crossref","first-page":"1530","DOI":"10.1016\/j.dam.2013.01.002","volume":"161","author":"M. Li","year":"2013","unstructured":"Li M.: Hamiltonian claw-free graphs involving minimum degrees. Discrete Appl. Math. 161, 1530\u20131537 (2013)","journal-title":"Discrete Appl. Math."},{"key":"1354_CR17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/j.disc.2003.12.007","volume":"283","author":"R. Li","year":"2004","unstructured":"Li R.: Hamiltonicity of 2-connected quasi-claw-free graphs. Discrete Math. 283, 145\u2013150 (2004)","journal-title":"Discrete Math."},{"key":"1354_CR18","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/S0012-365X(02)00882-8","volume":"265","author":"R. Li","year":"2003","unstructured":"Li R.: Hamiltonicity of 3-connected quasi-claw-free graphs. Discrete Math. 265, 393\u2013396 (2003)","journal-title":"Discrete Math."},{"key":"1354_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1002\/jgt.3190130309","volume":"13","author":"T.E. Lindquester","year":"1989","unstructured":"Lindquester T.E.: The effects of distance and neighborhood union conditions on hamiltonian properties in graphs. J. Graph Theory 13, 335\u2013352 (1989)","journal-title":"J. Graph Theory"},{"key":"1354_CR20","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1002\/jgt.3190090208","volume":"9","author":"M.M. Matthews","year":"1985","unstructured":"Matthews M.M., Sumner D.P.: Longest paths and cycles in K 1,3-free Graphs. J. Graph Theory 9, 269\u2013277 (1985)","journal-title":"J. Graph Theory"},{"key":"1354_CR21","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1002\/jgt.3190180505","volume":"18","author":"Z. Ryj\u00e1\u010dek","year":"1994","unstructured":"Ryj\u00e1\u010dek Z.: Almost claw-free graphs. J. Graph Theory 18, 469\u2013477 (1994)","journal-title":"J. Graph Theory"},{"key":"1354_CR22","unstructured":"West, D.B.: Introduction to Graph Theory, 2nd edn. Prentice Hall, Upper Saddle River (2001)"},{"key":"1354_CR23","first-page":"171","volume":"32","author":"K. Zhao","year":"2006","unstructured":"Zhao K., Liu B.: A neighborhood condition for vertices at distance two impling hamiltonian. Soochow J. Math. 32, 171\u2013177 (2006)","journal-title":"Soochow J. Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1354-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-013-1354-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-013-1354-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:36Z","timestamp":1559055576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-013-1354-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,4]]},"references-count":23,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2014,11]]}},"alternative-id":["1354"],"URL":"https:\/\/doi.org\/10.1007\/s00373-013-1354-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,4]]}}}