{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T09:56:08Z","timestamp":1776938168786,"version":"3.51.4"},"reference-count":3,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T00:00:00Z","timestamp":1159833600000},"content-version":"vor","delay-in-days":10808,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1977,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>It is shown that a connected graph <jats:italic>G<\/jats:italic> spans an eulerian graph if and only if <jats:italic>G<\/jats:italic> is not spanned by an odd complete bigraph <jats:italic>K<\/jats:italic>(2<jats:sub>m<\/jats:sub> + 1, 2<jats:italic>n<\/jats:italic> + 1). A disconnected graph spans an eulerian graph if and only if it is not the union of the trivial graph with a complete graph of odd order. Exact formulas are obtained for the number of lines which must be added to such graphs in order to get eulerian graphs.<\/jats:p>","DOI":"10.1002\/jgt.3190010115","type":"journal-article","created":{"date-parts":[[2007,5,29]],"date-time":"2007-05-29T06:03:44Z","timestamp":1180418624000},"page":"79-84","source":"Crossref","is-referenced-by-count":81,"title":["The spanning subgraphs of eulerian graphs"],"prefix":"10.1002","volume":"1","author":[{"given":"F. T.","family":"Boesch","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Suffel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Tindell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,3]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580113"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1137\/0202003"},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","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.3190010115","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190010115","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T09:56:53Z","timestamp":1699783013000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190010115"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,3]]},"references-count":3,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,3]]}},"alternative-id":["10.1002\/jgt.3190010115"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190010115","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,3]]}}}