{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T21:59:23Z","timestamp":1649195963949},"reference-count":18,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,1,1]],"date-time":"1983-01-01T00:00:00Z","timestamp":410227200000},"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":11155,"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":[[1983]]},"DOI":"10.1016\/0012-365x(83)90249-2","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T15:17:01Z","timestamp":1034090221000},"page":"159-171","source":"Crossref","is-referenced-by-count":3,"title":["Arbres minimaux d'un graphe preordonne"],"prefix":"10.1016","volume":"46","author":[{"given":"Claude","family":"Flament","sequence":"first","affiliation":[]},{"given":"Bruno","family":"Leclerc","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(83)90249-2_BIB1","series-title":"Graphes et Hypergraphes","author":"Berge","year":"1970"},{"key":"10.1016\/0012-365X(83)90249-2_BIB2","article-title":"On a minimal problem","volume":"3","author":"Boruvka","year":"1926","journal-title":"Prace Moravske Pridovedecke Spolecnosti"},{"key":"10.1016\/0012-365X(83)90249-2_BIB3","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1017\/S000497270004140X","article-title":"Comments on bases in dependence structures","volume":"2","author":"Brualdi","year":"1969","journal-title":"Bull. Austral. Math. Soc."},{"issue":"2","key":"10.1016\/0012-365X(83)90249-2_BIB4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1093\/qmath\/31.1.65","article-title":"Optimal matroid bases: an algorithm based on cocircuits","volume":"31","author":"Dawson","year":"1980","journal-title":"Quart. J. Math. Oxford"},{"key":"10.1016\/0012-365X(83)90249-2_BIB5","first-page":"5","article-title":"Ar\u00eates maximales des cocycles d'un graphe pr\u00e9ordonn\u00e9","volume":"51","author":"Flament","year":"1975","journal-title":"Math. Sci. Hum."},{"key":"10.1016\/0012-365X(83)90249-2_BIB6","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0012-365X(78)90154-1","article-title":"Hypergraphes arbor\u00e9s","volume":"21","author":"Flament","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90249-2_BIB7","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/S0021-9800(68)80039-0","article-title":"Optimal assignment in an ordered set. An application of matroid theory","volume":"4","author":"Gale","year":"1968","journal-title":"J. Combin. Theory"},{"key":"10.1016\/0012-365X(83)90249-2_BIB8","first-page":"11","article-title":"On the realizability of a set of trees","volume":"8","author":"Hakimi","year":"1961","journal-title":"IRE Trans. Comput. Theory"},{"key":"10.1016\/0012-365X(83)90249-2_BIB9","series-title":"Combinatorial Theory","author":"Hall","year":"1967"},{"key":"10.1016\/0012-365X(83)90249-2_BIB10","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0012-365X(77)90118-2","article-title":"The dependence graph for bases in matroids","volume":"19","author":"Krogdahl","year":"1977","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90249-2_BIB11","first-page":"48","article-title":"On the shortest spanning tree of a graph and a travelling salesman problem","volume":"7","author":"Kruskal","year":"1956"},{"key":"10.1016\/0012-365X(83)90249-2_BIB12","first-page":"5","article-title":"Hypergraphes uniformes pr\u00e9ordonn\u00e9s et arbres minimaux d'un graphe","volume":"A-284","author":"Leclerc","year":"1977","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(83)90249-2_BIB13","first-page":"301","article-title":"Matroides sur un ensemble pr\u00e9ordonn\u00e9. Bases minimales, circuits et cocircuits, parties commen\u00e7antes","volume":"A-286","author":"Leclerc","year":"1978","journal-title":"C.R. Acad. Sci. Paris"},{"key":"10.1016\/0012-365X(83)90249-2_BIB14_1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0095-8956(73)90005-1","article-title":"Matroid basis graphs I, II","volume":"14","author":"Maurer","year":"1973","journal-title":"J. Combin Theory (B)"},{"key":"10.1016\/0012-365X(83)90249-2_BIB14_2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0095-8956(73)90013-0","article-title":"Matroid basis graphs I, II","volume":"15","author":"Maurer","year":"1973","journal-title":"J. Combin Theory (B)"},{"key":"10.1016\/0012-365X(83)90249-2_BIB15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0012-365X(75)90007-2","article-title":"Intervals in matroid bases graphs","volume":"11","author":"Maurer","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(83)90249-2_BIB16","series-title":"Th\u00e9orie des Graphes","article-title":"L'arbre minimum d'un graphe","author":"Rosenstiehl","year":"1967"},{"key":"10.1016\/0012-365X(83)90249-2_BIB17","series-title":"Matroid Theory","author":"Welsh","year":"1976"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"fr","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902492?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X83902492?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,10]],"date-time":"2019-04-10T14:51:07Z","timestamp":1554907867000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X83902492"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983]]}},"alternative-id":["0012365X83902492"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(83)90249-2","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1983]]}}}