{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T05:40:18Z","timestamp":1671774018948},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T00:00:00Z","timestamp":1454889600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"JSPS KAKENHI","award":["26800083"],"award-info":[{"award-number":["26800083"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s00373-015-1673-8","type":"journal-article","created":{"date-parts":[[2016,2,8]],"date-time":"2016-02-08T08:24:30Z","timestamp":1454919870000},"page":"1773-1788","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Dominating Cycles and Forbidden Pairs Containing $$P_{5}$$ P 5"],"prefix":"10.1007","volume":"32","author":[{"given":"Shuya","family":"Chiba","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michitaka","family":"Furuya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shoichi","family":"Tsuchiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,2,8]]},"reference":[{"key":"1673_CR1","unstructured":"Bedrossian, P.: Forbidden subgraph and minimum degree conditions for Hamiltonicity. Ph.D.\u00a0Thesis, Memphis State University (1991)"},{"key":"1673_CR2","unstructured":"Broersma, H.J., Veldman, H.J.: Restrictions on induced subgraphs ensuring Hamiltonicity or pancyclicity of $$K_{1, 3}$$ K 1 , 3 -free graphs. In: Bodendiek, R. (ed.) Contemporary Methods in Graph Theory, pp. 181\u2013194 (1990)"},{"key":"1673_CR3","doi-asserted-by":"crossref","first-page":"2442","DOI":"10.1016\/j.disc.2015.06.018","volume":"338","author":"S Chiba","year":"2015","unstructured":"Chiba, S., Furuya, M., Tsuchiya, S.: Forbidden pairs and the existence of a dominating cycle. Discrete Math. 338, 2442\u20132452 (2015)","journal-title":"Discrete Math."},{"key":"1673_CR4","doi-asserted-by":"crossref","unstructured":"Diestel, R.: Graph Theory, Fourth edition. Graduate Texts in Mathematics, vol. 173. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14279-6"},{"key":"1673_CR5","volume-title":"Forbidden subgraphs and the hamiltonian theme. The theory and applications of graphs, pp. 297\u2013316","author":"D Duffus","year":"1981","unstructured":"Duffus, D., Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and the hamiltonian theme. The theory and applications of graphs, pp. 297\u2013316. Wiley, New York (1981)"},{"key":"1673_CR6","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/S0012-365X(96)00147-1","volume":"173","author":"RJ Faudree","year":"1997","unstructured":"Faudree, R.J., Gould, R.J.: Characterizing forbidden pairs for Hamiltonian properties. Discrete Math. 173, 45\u201360 (1997)","journal-title":"Discrete Math."},{"key":"1673_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0012-365X(82)90216-3","volume":"42","author":"RJ Gould","year":"1982","unstructured":"Gould, R.J., Jacobson, M.S.: Forbidden subgraphs and Hamiltonian properties of graphs. Discrete Math. 42, 189\u2013196 (1982)","journal-title":"Discrete Math."},{"key":"1673_CR8","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(88)90143-3","volume":"28","author":"S Olariu","year":"1988","unstructured":"Olariu, S.: Paw-free graph. Inf. Process. Lett. 28, 53\u201354 (1988)","journal-title":"Inf. Process. Lett."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1673-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-015-1673-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-015-1673-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T10:59:42Z","timestamp":1559041182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-015-1673-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,8]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["1673"],"URL":"https:\/\/doi.org\/10.1007\/s00373-015-1673-8","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,2,8]]}}}