{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T16:55:37Z","timestamp":1648832137054},"reference-count":6,"publisher":"Elsevier BV","issue":"3","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)90024-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:33:13Z","timestamp":1027639993000},"page":"203-208","source":"Crossref","is-referenced-by-count":5,"title":["The decompositions of line graphs, middle graphs and total graphs of complete graphs into forests"],"prefix":"10.1016","volume":"26","author":[{"given":"Jin","family":"Akiyama","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takashi","family":"Hamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(79)90024-4_BIB1","first-page":"109","article-title":"Triangles in line-graphs and total graphs","volume":"10","author":"Behzad","year":"1968","journal-title":"Indian J. of Math."},{"key":"10.1016\/0012-365X(79)90024-4_BIB2","first-page":"589","article-title":"Decompositions of complete graphs into forests","volume":"9","author":"Beineke","year":"1964","journal-title":"Mat. Kutato Int. Kozl."},{"key":"10.1016\/0012-365X(79)90024-4_BIB3","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0012-365X(76)90037-6","article-title":"Traversability and connectivity of the middle graph of a graph","volume":"14","author":"Hamada","year":"1976","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(79)90024-4_BIB4","series-title":"Graph Theory","author":"Harary","year":"1969"},{"key":"10.1016\/0012-365X(79)90024-4_BIB5","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(79)90024-4_BIB6","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."}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900244?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X79900244?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T07:22:53Z","timestamp":1555140173000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X79900244"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1979]]}},"alternative-id":["0012365X79900244"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(79)90024-4","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}