{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T09:56:06Z","timestamp":1776938166588,"version":"3.51.4"},"reference-count":7,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":9894,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1979,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We show that the problem raised by Boesch, Suffel, and Tindell of determining whether or not a graph is spanned by an Eulerian subgraph is NP\u2010complete. We also note that there does exist a good algorithm for determining if a graph is spanned by a subgraph having positive even degree at every node.<\/jats:p>","DOI":"10.1002\/jgt.3190030316","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:25:14Z","timestamp":1180419914000},"page":"309-310","source":"Crossref","is-referenced-by-count":72,"title":["A note on graphs spanned by Eulerian graphs"],"prefix":"10.1002","volume":"3","author":[{"given":"W. R.","family":"Pulleyblank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","volume-title":"The Design and Analysis of Computer Algorithms","author":"Aho A. V.","year":"1974"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190010115"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_2_1_5_2","first-page":"128","article-title":"Solution probleatis ad geometriam situs pertinentis","volume":"8","author":"Euler L.","year":"1736","journal-title":"Comm. Acad. Sci. Imp. Petropol."},{"key":"e_1_2_1_5_3","volume-title":"Graph Theory 1736\u20131936","author":"Biggs N. L.","year":"1976"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1145\/800119.803884"},{"key":"e_1_2_1_7_2","doi-asserted-by":"crossref","unstructured":"F.Harary Graph Theory. Addison\u2010Wesley Reading Mass. (1969).","DOI":"10.21236\/AD0705364"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190030316","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190030316","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T13:12:19Z","timestamp":1697721139000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190030316"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,9]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979,9]]}},"alternative-id":["10.1002\/jgt.3190030316"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190030316","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,9]]}}}