{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T14:13:00Z","timestamp":1648649580032},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"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":12616,"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":[[1979]]},"DOI":"10.1016\/0012-365x(79)90106-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:33:13Z","timestamp":1027654393000},"page":"149-170","source":"Crossref","is-referenced-by-count":0,"title":["Subgraphs with triangular components"],"prefix":"10.1016","volume":"27","author":[{"given":"Paul A.","family":"Catlin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90106-7_BIB1","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0012-365X(74)90119-8","article-title":"Subgraphs of graphs I","volume":"10","author":"Catlin","year":"1974","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90106-7_BIB2","article-title":"Embedding subgraphs and coloring graphs under extremal degree conditions","author":"Catlin","year":"1976"},{"key":"10.1016\/0012-365X(79)90106-7_BIB3","first-page":"139","article-title":"Embedding subgraphs under extremal degree conditions","author":"Catlin","year":"1977","journal-title":"Proc. 8th Southeastern Conf. on Combinatorics, Graph Theory, and Computing"},{"key":"10.1016\/0012-365X(79)90106-7_BIB4","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1002\/jgt.3190020210","article-title":"Graph decompositions satisfying extremal degree constraints","volume":"2","author":"Catlin","year":"1978","journal-title":"J. Graph Theory"},{"key":"10.1016\/0012-365X(79)90106-7_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/BF01895727","article-title":"On the maximal number of independent circuits in a graph","volume":"14","author":"Corr\u00e1di","year":"1963","journal-title":"Acta Math. Hung."},{"key":"10.1016\/0012-365X(79)90106-7_BIB6","first-page":"601","article-title":"Proof of a conjecture of Erd\u00f6s","author":"Hajnal","year":"1970"},{"key":"10.1016\/0012-365X(79)90106-7_BIB7","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(79)90106-7_BIB8","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0095-8956(78)90005-9","article-title":"Edge disjoint placement of graphs","volume":"25","author":"Sauer","year":"1978","journal-title":"J. Combinatorial Theory"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901067?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79901067?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T11:23:14Z","timestamp":1555154594000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79901067"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79901067"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90106-7","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}