{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T18:12:10Z","timestamp":1759601530184,"version":"3.37.3"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T00:00:00Z","timestamp":1524096000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11671376"],"award-info":[{"award-number":["11671376"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2018,7]]},"DOI":"10.1007\/s00373-018-1892-x","type":"journal-article","created":{"date-parts":[[2018,4,19]],"date-time":"2018-04-19T01:40:47Z","timestamp":1524102047000},"page":"535-544","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Odd Induced Subgraphs in Graphs with Treewidth at Most Two"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7634-0250","authenticated-orcid":false,"given":"Xinmin","family":"Hou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lei","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaao","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Boyuan","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,19]]},"reference":[{"key":"1892_CR1","first-page":"81","volume":"15","author":"DM Berman","year":"1997","unstructured":"Berman, D.M., Wang, H., Wargo, L.: Odd induced subgraphs in graphs of maximum degree three. Aust. J. Comb. 15, 81\u201385 (1997)","journal-title":"Aust. J. Comb."},{"key":"1892_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0012-365X(92)00563-7","volume":"132","author":"Y Caro","year":"1994","unstructured":"Caro, Y.: On induced subgraphs with odd degrees. Discrete Math. 132, 23\u201328 (1994)","journal-title":"Discrete Math."},{"key":"1892_CR3","volume-title":"Graph Theory","author":"R Diestel","year":"2000","unstructured":"Diestel, R.: Graph Theory. Springer, New York (2000)"},{"key":"1892_CR4","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/S0012-365X(03)00059-1","volume":"269","author":"KW Lih","year":"2003","unstructured":"Lih, K.W., Wang, W.F., Zhu, X.D.: Coloring the square of a \n                    \n                      \n                    \n                    $$K_4$$\n                    \n                      \n                        \n                          K\n                          4\n                        \n                      \n                    \n                  -minor free graph. Discrete Math. 269, 303\u2013309 (2003)","journal-title":"Discrete Math."},{"key":"1892_CR5","volume-title":"Combinatorial Problems and Exercises","author":"L Lov\u00e1sz","year":"1979","unstructured":"Lov\u00e1sz, L.: Combinatorial Problems and Exercises. North-Holland, Amsterdam (1979)"},{"key":"1892_CR6","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/0012-365X(93)E0186-8","volume":"140","author":"AJ Radcliffe","year":"1995","unstructured":"Radcliffe, A.J., Scott, A.D.: Every tree contains a large induced subgraph with all degrees odd. Discrete Math. 140, 275\u2013279 (1995)","journal-title":"Discrete Math."},{"key":"1892_CR7","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1017\/S0963548300000389","volume":"1","author":"AD Scott","year":"1992","unstructured":"Scott, A.D.: Large induced subgraphs with all degrees odd. Comb. Probab. Comput. 1, 335\u2013349 (1992)","journal-title":"Comb. Probab. Comput."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-018-1892-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1892-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-018-1892-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T19:34:10Z","timestamp":1555616050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-018-1892-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,19]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["1892"],"URL":"https:\/\/doi.org\/10.1007\/s00373-018-1892-x","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2018,4,19]]},"assertion":[{"value":"24 May 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 May 2017","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}