{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,24]],"date-time":"2026-04-24T19:44:24Z","timestamp":1777059864939,"version":"3.51.4"},"reference-count":7,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1986,7,1]],"date-time":"1986-07-01T00:00:00Z","timestamp":520560000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T00:00:00Z","timestamp":1378857600000},"content-version":"vor","delay-in-days":9934,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1986,7]]},"DOI":"10.1016\/s0195-6698(86)80032-4","type":"journal-article","created":{"date-parts":[[2013,9,10]],"date-time":"2013-09-10T12:54:23Z","timestamp":1378817663000},"page":"263-270","source":"Crossref","is-referenced-by-count":32,"title":["Graphes \u00c9quilibr\u00e9s et Arboricit\u00e9 Rationnelle"],"prefix":"10.1016","volume":"7","author":[{"given":"C.","family":"Payan","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0195-6698(86)80032-4_bib1","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1973"},{"key":"10.1016\/S0195-6698(86)80032-4_bib2","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0195-6698(86)80032-4_bib3","first-page":"12","article-title":"Decomposition of finite graphs into forest","volume":"39","author":"St.","year":"1964","journal-title":"J. London Math. Soc"},{"key":"10.1016\/S0195-6698(86)80032-4_bib4","unstructured":"Kar\u00f3nski and Ruci\u0144ski, Session de Probl\u00e8mes, 3 \u00e8me Symposium de Th\u00e9orie des Graphes, Prague, 1982."},{"key":"10.1016\/S0195-6698(86)80032-4_bib5","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/BF01111390","article-title":"Subgraphs as matroid cells","volume":"127","author":"Simoes-Pereira","year":"1972","journal-title":"Maths. Z."},{"key":"10.1016\/S0195-6698(86)80032-4_bib6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1093\/qmath\/28.2.213","article-title":"Bicicular matroids","volume":"28","author":"Mathews","year":"1977","journal-title":"Quart. J. Math. Oxford (2)"},{"key":"10.1016\/S0195-6698(86)80032-4_bib7","doi-asserted-by":"crossref","first-page":"67","DOI":"10.6028\/jres.069B.004","article-title":"Minimum partition of a matroid into independent subsets","volume":"69B","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Stand"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669886800324?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0195669886800324?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2018,10,13]],"date-time":"2018-10-13T06:23:02Z","timestamp":1539411782000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0195669886800324"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,7]]},"references-count":7,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,7]]}},"alternative-id":["S0195669886800324"],"URL":"https:\/\/doi.org\/10.1016\/s0195-6698(86)80032-4","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1986,7]]}}}