{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T22:18:45Z","timestamp":1782425925208,"version":"3.54.5"},"reference-count":7,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":7747,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1992,5]]},"DOI":"10.1016\/0012-365x(92)90587-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:43Z","timestamp":1027655023000},"page":"33-37","source":"Crossref","is-referenced-by-count":18,"title":["Spanning eularian subgraphs, the splitting Lemma, and Petersen's theorem"],"prefix":"10.1016","volume":"101","author":[{"given":"Herbert","family":"Fleischner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90587-6_BIB1","article-title":"Eularian Graphs and Related Topics, Part 1","volume":"Vol. 1","author":"Fleischner","year":"1990"},{"key":"10.1016\/0012-365X(92)90587-6_BIB2","article-title":"Eularian Graphs and Related Topics, Part 1","volume":"Vol.2","author":"Fleischner","year":"1991"},{"key":"10.1016\/0012-365X(92)90587-6_BIB3","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0095-8956(74)90090-2","article-title":"On spanning subgraphs of a connected bridgeless graph and their application to DT-graphs","volume":"1","author":"Fleischner","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90587-6_BIB4","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0095-8956(79)90057-1","article-title":"Flows and generalized coloring theorems in graphs","volume":"26","author":"Jaeger","year":"1979","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90587-6_BIB5","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0095-8956(74)90087-2","article-title":"Bounds on the number of disjoint spanning trees","volume":"17","author":"Kundu","year":"1974","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/0012-365X(92)90587-6_BIB6","first-page":"165","article-title":"A lower boundary for the reliability of information networks","volume":"7","author":"Polesski","year":"1971","journal-title":"Problems Inform. Transmission"},{"key":"10.1016\/0012-365X(92)90587-6_BIB7","first-page":"59","article-title":"Supereulerian graphs","volume":"64","author":"Catlin","year":"1988","journal-title":"Congr. Numer."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905876?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X92905876?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T06:25:53Z","timestamp":1555136753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X92905876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":7,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["0012365X92905876"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90587-6","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}