{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:19:31Z","timestamp":1648901971517},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2011,11,8]],"date-time":"2011-11-08T00:00:00Z","timestamp":1320710400000},"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,3]]},"DOI":"10.1007\/s00373-011-1108-0","type":"journal-article","created":{"date-parts":[[2011,11,7]],"date-time":"2011-11-07T10:35:26Z","timestamp":1320662126000},"page":"275-280","source":"Crossref","is-referenced-by-count":1,"title":["Spanning Eulerian Subgraphs of 2-Edge-Connected Graphs"],"prefix":"10.1007","volume":"29","author":[{"given":"Xiangwen","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chunxiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qiong","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohong","family":"Niu","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":[[2011,11,8]]},"reference":[{"key":"1108_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J.A. Bondy","year":"1976","unstructured":"Bondy J.A., Murty U.S.R.: Graph Theory with Applications. American Elsevier, New York (1976)"},{"key":"1108_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/S0166-218X(01)00278-5","volume":"120","author":"H.J. Broersma","year":"2002","unstructured":"Broersma H.J., Xiong L.: A note on minimun degree conditions for supereulerian graphs. Discrete Appl. Math. 120, 35\u201343 (2002)","journal-title":"Discrete Appl. Math."},{"key":"1108_CR3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","volume":"12","author":"P.A. Catlin","year":"1998","unstructured":"Catlin P.A.: A reduction method to find spanning eulerian subgraphs. J. Graph Theory 12, 29\u201345 (1998)","journal-title":"J. Graph Theory"},{"key":"1108_CR4","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/S0012-365X(95)00149-Q","volume":"160","author":"P.A. Catlin","year":"1996","unstructured":"Catlin P.A., Han Z.Y., Lai H.-J.: Graphs without spanning closed trails. Discrete Math. 160, 81\u201391 (1996)","journal-title":"Discrete Math."},{"key":"1108_CR5","first-page":"65","volume":"160","author":"P.A. Catlin","year":"1999","unstructured":"Catlin P.A., Li X.: Supereulerian graphs of minimum degree at least 4. J. Adv. Math. 160, 65\u201369 (1999)","journal-title":"J. Adv. Math."},{"key":"1108_CR6","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.3190030110","volume":"3","author":"F. Jaeger","year":"1979","unstructured":"Jaeger F.: A note on sub-Eulerian graphs. J. Graph Theory 3, 91\u201393 (1979)","journal-title":"J. Graph Theory"},{"key":"1108_CR7","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1016\/j.dam.2010.12.005","volume":"159","author":"H.-J. Lai","year":"2011","unstructured":"Lai H.-J., Liang Y.: Supereulerian graphs in the graph family C 2(6, k). Discrete Appl. Math. 159, 467\u2013477 (2011)","journal-title":"Discrete Appl. Math."},{"key":"1108_CR8","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1016\/j.dam.2004.04.005","volume":"145","author":"D. Li","year":"2005","unstructured":"Li D., Lai H.-J., Zhan M.: Eulerian subgraphs and Hamilton-connected line graphs. Discrete Appl. Math. 145, 422\u2013428 (2005)","journal-title":"Discrete Appl. Math."},{"key":"1108_CR9","doi-asserted-by":"crossref","first-page":"2937","DOI":"10.1016\/j.disc.2008.06.038","volume":"309","author":"X. Li","year":"2009","unstructured":"Li X., Li D., Lai H.-J.: The supereulerian graphs in the graph family C(l, k). Discrete Math. 309, 2937\u20132942 (2009)","journal-title":"Discrete Math."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1108-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-011-1108-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-011-1108-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T14:59:32Z","timestamp":1559055572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-011-1108-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,8]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["1108"],"URL":"https:\/\/doi.org\/10.1007\/s00373-011-1108-0","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"value":"0911-0119","type":"print"},{"value":"1435-5914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11,8]]}}}