{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:54:23Z","timestamp":1725702863913},"reference-count":13,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1996,11,1]],"date-time":"1996-11-01T00:00:00Z","timestamp":846806400000},"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":6102,"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":[[1996,11]]},"DOI":"10.1016\/s0012-365x(95)00149-q","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"81-91","source":"Crossref","is-referenced-by-count":73,"title":["Graphs without spanning closed trails"],"prefix":"10.1016","volume":"160","author":[{"given":"Paul A.","family":"Catlin","sequence":"first","affiliation":[]},{"given":"Zheng-Yiao","family":"Han","sequence":"additional","affiliation":[]},{"given":"Hong-Jian","family":"Lai","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(95)00149-Q_BIB1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/jgt.3190010115","article-title":"The spanning subgraphs of eulerian graphs","volume":"1","author":"Boesch","year":"1977","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB3","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/jgt.3190120105","article-title":"A reduction method to find spanning eulerian subgraphs","volume":"12","author":"Catlin","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB4","first-page":"115","article-title":"Nearly eulerian spanning subgraphs","volume":"25","author":"Catlin","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB5","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(89)90303-8","article-title":"Spanning eulerian subgraphs and matchings","volume":"76","author":"Catlin","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB6","series-title":"Proc. 18th Southeastern Conf.","first-page":"233","article-title":"Supereulerian graphs, collapsible graphs and four-cycles","volume":"58","author":"Catlin","year":"1987"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB7","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1002\/jgt.3190160209","article-title":"Supereulerian graphs: a survey","volume":"16","author":"Catlin","year":"1992","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB8","series-title":"Graph Theory, Combinatorics, and Applications","first-page":"207","article-title":"Spanning trails joining two given edges","author":"Catlin","year":"1991"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB9","first-page":"79","article-title":"Supereulerian graphs and the Petersen graph","volume":"9","author":"Chen","year":"1991","journal-title":"J. Combin. Math. Combin. Comput."},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB10","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1002\/jgt.3190030110","article-title":"A note on sub-Eulerian graphs","volume":"3","author":"Jaeger","year":"1979","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB11","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1002\/jgt.3190140109","article-title":"Reduced graphs of diameter two","volume":"14","author":"Lai","year":"1990","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB12","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decomposition of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0012-365X(95)00149-Q_BIB13","first-page":"89","article-title":"Hamiltonian connectedness of line graphs","volume":"22","author":"Zhan","year":"1986","journal-title":"Ars Combin."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9500149Q?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X9500149Q?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:25:54Z","timestamp":1556130354000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X9500149Q"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,11]]},"references-count":13,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1996,11]]}},"alternative-id":["S0012365X9500149Q"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(95)00149-q","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,11]]}}}