{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T02:41:29Z","timestamp":1777430489474,"version":"3.51.4"},"reference-count":21,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1992,12,1]],"date-time":"1992-12-01T00:00:00Z","timestamp":723168000000},"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":7533,"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,12]]},"DOI":"10.1016\/0012-365x(92)90705-k","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:34Z","timestamp":1027655014000},"page":"165-177","source":"Crossref","is-referenced-by-count":8,"title":["Duality in graph families"],"prefix":"10.1016","volume":"110","author":[{"given":"Hong-Jian","family":"Lai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyuan","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(92)90705-K_BIB1","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/0012-365X(92)90705-K_BIB2","unstructured":"P.A. Catlin, The reduction of graph families closed under contraction, submitted."},{"key":"10.1016\/0012-365X(92)90705-K_BIB3","unstructured":"P.A. Catlin, Four operations on families of graphs, submitted."},{"key":"10.1016\/0012-365X(92)90705-K_BIB4","first-page":"233","article-title":"Supereulerian graphs, collapsible graphs, and four-cycles","volume":"58","author":"Catlin","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(92)90705-K_BIB5","first-page":"159","article-title":"A reduction method for graphs","volume":"65","author":"Catlin","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(92)90705-K_BIB6","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\/0012-365X(92)90705-K_BIB7","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/jgt.3190130408","article-title":"Double cycle covers and the Petersen graph","volume":"13","author":"Catlin","year":"1989","journal-title":"J. Graph theory"},{"key":"10.1016\/0012-365X(92)90705-K_BIB8","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0012-365X(89)90303-8","article-title":"Spanning eulerian subgraphs and matching","volume":"76","author":"Catlin","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90705-K_BIB9","first-page":"59","article-title":"Supereulerian graphs","volume":"64","author":"Catlin","year":"1988","journal-title":"Congr. Numer."},{"key":"10.1016\/0012-365X(92)90705-K_BIB10","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\/0012-365X(92)90705-K_BIB11","first-page":"115","article-title":"Nearly eulerian spanning subgraphs","volume":"25","author":"Catlin","year":"1988","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(92)90705-K_BIB12","doi-asserted-by":"crossref","unstructured":"P.A. Catlin, J.W. Grossman, A.M. Hobbs and H.-J. Lai, Fractional arboricity, strength and principal partitions in graphs and matroids, Discrete Appl. Math., to appear.","DOI":"10.1016\/0166-218X(92)90002-R"},{"key":"10.1016\/0012-365X(92)90705-K_BIB13","first-page":"177","article-title":"Eulerian subgraphs on graphs with short cycles","volume":"30","author":"Catlin","year":"1990","journal-title":"Ars Combin."},{"key":"10.1016\/0012-365X(92)90705-K_BIB14","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/jgt.3190120103","article-title":"Contactions and hamiltonian line graphs","volume":"12","author":"Lai","year":"1988","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(92)90705-K_BIB15","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0012-365X(88)90176-8","article-title":"On the hamiltonian index","volume":"69","author":"Lai","year":"1988","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90705-K_BIB16","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0012-365X(91)90302-I","article-title":"Graphs whose edges are in small cycles","volume":"94","author":"Lai","year":"1991","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(92)90705-K_BIB17","series-title":"Ph.D. Dissertation","author":"Lai","year":"1988"},{"key":"10.1016\/0012-365X(92)90705-K_BIB18","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1112\/jlms\/s1-36.1.445","article-title":"Edge-disjoint spanning trees of finite graphs","volume":"36","author":"Nash-Williams","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(92)90705-K_BIB19","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1112\/jlms\/s1-39.1.12","article-title":"Decompositions of finite graphs into forests","volume":"39","author":"Nash-Williams","year":"1964","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(92)90705-K_BIB20","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1112\/jlms\/s1-36.1.221","article-title":"On the problem of decomposing a graph into n connected factors","volume":"36","author":"Tutte","year":"1961","journal-title":"J. London Math. Soc."},{"key":"10.1016\/0012-365X(92)90705-K_BIB21","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290705K?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X9290705K?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:30Z","timestamp":1555134690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X9290705K"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,12]]},"references-count":21,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,12]]}},"alternative-id":["0012365X9290705K"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(92)90705-k","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1992,12]]}}}