{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,19]],"date-time":"2023-10-19T00:44:33Z","timestamp":1697676273331},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0012-365x(97)00028-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"73-87","source":"Crossref","is-referenced-by-count":6,"title":["Supereulerian graphs, independent sets, and degree-sum conditions"],"prefix":"10.1016","volume":"179","author":[{"given":"Zhi-Hong","family":"Chen","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0012-365X(97)00028-9_BIB1","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1002\/jgt.3190100317","article-title":"On circuits and pancyclic line graphs","volume":"10","author":"Benhocine","year":"1986","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00028-9_BIB2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0012-365X(97)00028-9_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(97)00028-9_BIB4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF02189088","article-title":"Contractions of graphs with no spanning eulerian subgraphs","volume":"8","author":"Catlin","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/S0012-365X(97)00028-9_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(97)00028-9_BIB6","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(97)00028-9_BIB7","article-title":"Reductions of graphs and spanning eulerian subgraphs","author":"Chen","year":"1991"},{"key":"10.1016\/S0012-365X(97)00028-9_BIB8","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1002\/jgt.3190170103","article-title":"A degree condition for spanning eulerian subgraphs","volume":"17","author":"Chen","year":"1993","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00028-9_BIB9","unstructured":"Z.H. Chen, H.J. Lai, Supereulerian graphs and the Petersen graph, II. Ars Combin. to appear."},{"key":"10.1016\/S0012-365X(97)00028-9_BIB10","unstructured":"Z.Q. Chen, Y.F. Xue, On spanning trails and dominating trails, preprint."},{"key":"10.1016\/S0012-365X(97)00028-9_BIB11","doi-asserted-by":"crossref","first-page":"701","DOI":"10.4153\/CMB-1965-051-3","article-title":"On eulerian and hamiltonian graphs and line graphs","volume":"8","author":"Harary","year":"1965","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00028-9_BIB12","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/jgt.3190120103","article-title":"Contractions and hamiltonian line graphs","volume":"12","author":"Lai","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0012-365X(97)00028-9_BIB13","doi-asserted-by":"crossref","first-page":"215","DOI":"10.4153\/CMB-1977-034-8","article-title":"On spanning and dominating circuits in graphs","volume":"20","author":"Lesniak-Foster","year":"1977","journal-title":"Canad. Math. Bull."},{"key":"10.1016\/S0012-365X(97)00028-9_BIB14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1002\/jgt.3190100105","article-title":"Existence of spanning and dominating trails and circuits","volume":"10","author":"Veldman","year":"1986","journal-title":"J. Graph Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000289?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0012365X97000289?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T23:22:45Z","timestamp":1556666565000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0012365X97000289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0012365X97000289"],"URL":"https:\/\/doi.org\/10.1016\/s0012-365x(97)00028-9","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}