{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,1]],"date-time":"2022-06-01T06:51:55Z","timestamp":1654066315373},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2012,10,27]],"date-time":"2012-10-27T00:00:00Z","timestamp":1351296000000},"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":[[2013,11]]},"DOI":"10.1007\/s00373-012-1245-0","type":"journal-article","created":{"date-parts":[[2012,10,26]],"date-time":"2012-10-26T09:42:10Z","timestamp":1351244530000},"page":"1755-1775","source":"Crossref","is-referenced-by-count":4,"title":["Two Forbidden Subgraph Pairs for Hamiltonicity of 3-Connected Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Zhiquan","family":"Hu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houyuan","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,10,27]]},"reference":[{"key":"1245_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for hamiltoncity. Thesis, Memphis State University, USA (1991)"},{"key":"1245_CR2","unstructured":"Broersma, H.J., Veldman, H.J.: Restrictions on induced subgraphs ensuring hamiltonity or pancyclicity of K 1,3-free graphs. In: Contemporary methods in Graph Theory (Bodendiek, R.), BI-Wiss.-Verl., Mannheim-Wien-Z $${\\ddot{u}}$$ urich, pp. 181\u2013194 (1990)"},{"key":"1245_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0012-365X(98)00334-3","volume":"196","author":"J. Brousek","year":"1999","unstructured":"Brousek J., Ryj\u00e1\u010dek Z., Favaron O.: Forbidden subgraphs, hamiltonianicity and closure in claw-free graph. Discret. Math. 196, 29\u201350 (1999)","journal-title":"Discret. Math."},{"key":"1245_CR4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"P.A. Catlin","year":"1988","unstructured":"Catlin P.A.: A reduction methods to find spanning eulerian subgraphs. J. Graph Theory 12, 29\u201344 (1988)","journal-title":"J. Graph Theory"},{"key":"1245_CR5","unstructured":"Chen, Z.: Reduction of graphs and spanning eulerian subgraphs. Thesis, Wayne State University (1991)"},{"key":"1245_CR6","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, 3rd Ed. Springer, Berlin (2005)","DOI":"10.1007\/978-3-642-14279-6_7"},{"key":"1245_CR7","unstructured":"Duffus, D., Jacobson, M.S., Gould, R.J.: Forbidden subgraphs and the hamiltonian theme. In: The theory and applications of graphs, (Kalamazoo, Mich. 1980). Wiley, New York, pp. 297\u2013316 (1981)"},{"key":"1245_CR8","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"R.J. Faudree","year":"1997","unstructured":"Faudree R.J., Gould R.J.: Characterizing forbidden pairs for hamiltonian properties. Discret. Math. 173, 45\u201360 (1997)","journal-title":"Discret. Math."},{"key":"1245_CR9","doi-asserted-by":"crossref","unstructured":"Fujisawa, J.: Forbidden subgraphs for hamiltonicity of 3-connected claw-free graphs. J. Graph Theory (2012). doi: 10.1002\/jgt.21663","DOI":"10.1002\/jgt.21663"},{"key":"1245_CR10","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0095-8956(74)90061-6","volume":"16","author":"S. Goodman","year":"1974","unstructured":"Goodman S., Hedetniemi S.: Sufficient conditions for a graph to be hamiltonian. J. Combin. Theory Ser. B 16, 175\u2013180 (1974)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1245_CR11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","volume":"42","author":"R.J. Gould","year":"1982","unstructured":"Gould R.J., Jacobson M.S.: Forbidden subgraphs and hamiltonian properties of graphs. Discret. Math. 42, 189\u2013196 (1982)","journal-title":"Discret. Math."},{"key":"1245_CR12","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","volume":"8","author":"F. Harary","year":"1965","unstructured":"Harary F., Nash-Williams C.St.J.A.: On eulerian and hamiltonian graphs and line graphs. Can. Math. Bull. 8, 701\u2013710 (1965)","journal-title":"Can. Math. Bull."},{"key":"1245_CR13","unstructured":"Hu, Z., Lin, H.: Four forbidden subgraph pairs for hamiltonicity of 3-connected graph. (submitted)"},{"key":"1245_CR14","unstructured":"Hu, Z., Lin, H.: Every 3-connected {K 1,3,N 3,3,3}-free graph is hamiltonian. (submitted)"},{"key":"1245_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/jgt.20433","volume":"64","author":"H. Lai","year":"2010","unstructured":"Lai H., Xiong L., Yan H., Yan J.: Every 3-connected claw-free Z 8-free graph is hamilonian. J. Graph Theory 64, 1\u201311 (2010)","journal-title":"J. Graph Theory"},{"key":"1245_CR16","unstructured":"Lin, H.: Forbidden subgraphs and hamiltonicity. Dissertation for Ph.D, The school of Mathematics and Statistics, Central China Normal University (2012)"},{"key":"1245_CR17","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/jgt.20019","volume":"47","author":"T. \u0141uczak","year":"2004","unstructured":"\u0141uczak T., Pfender F.: Claw-free 3-connected P 11-free graphs are hamiltonian. J. Graph Theory 47, 111\u2013121 (2004)","journal-title":"J. Graph Theory"},{"key":"1245_CR18","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1006\/jctb.1996.1732","volume":"70","author":"Z. Ryj\u00e1\u010dek","year":"1997","unstructured":"Ryj\u00e1\u010dek Z.: On a closure concept in claw-free graphs. J. Combin. Theory Ser. B 70, 217\u2013224 (1997)","journal-title":"J. Combin. Theory Ser. B"},{"key":"1245_CR19","unstructured":"Shao, Y.: Claw-free graphs and line graphs. Thesis, Department of Mathematics, West Virginia University (2005)"}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1245-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-012-1245-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-012-1245-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T00:58:03Z","timestamp":1562288283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-012-1245-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,27]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["1245"],"URL":"https:\/\/doi.org\/10.1007\/s00373-012-1245-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,27]]}}}