{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T16:41:26Z","timestamp":1758818486945},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1991,9,1]],"date-time":"1991-09-01T00:00:00Z","timestamp":683683200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinatorica"],"published-print":{"date-parts":[[1991,9]]},"DOI":"10.1007\/bf01205074","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T15:15:52Z","timestamp":1109258152000},"page":"219-230","source":"Crossref","is-referenced-by-count":17,"title":["b-matching degree-sequence polyhedra"],"prefix":"10.1007","volume":"11","author":[{"given":"William H.","family":"Cunningham","sequence":"first","affiliation":[]},{"given":"Jan","family":"Green-Kr\ufffdtki","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1002\/net.3230130405","volume":"13","author":"E. Balas","year":"1983","unstructured":"E. Balas andW. R. Pulleyblank: The perfectly matchable subgraph polytope of a bipartite graph,Networks 13 (1983), 495?516.","journal-title":"Networks"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02125345","volume":"9","author":"E. Balas","year":"1989","unstructured":"E. Balas andW. R. Pulleyblank: The perfectly matchable subgraph polytope of an arbitrary graph,Combinatorica 9 (1989), 321?337.","journal-title":"Combinatorica"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02604639","volume":"38","author":"A. Bouchet","year":"1987","unstructured":"A. Bouchet: Greedy algorithm and symmetric matroids,Math. Programming 38 (1987), 147?159.","journal-title":"Math. Programming"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0166-218X(92)90272-C","volume":"24","author":"A. Bouchet","year":"1989","unstructured":"A. Bouchet: ?-matroids and matchings,Discrete Applied Math. 24 (1989), 55?62.","journal-title":"Discrete Applied Math."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1016\/0012-365X(88)90101-X","volume":"71","author":"R. Chandrasekaran","year":"1988","unstructured":"R. Chandrasekaran andS. N. Kabadi Pseudomatroids,Discrete Math. 71 (1988), 205?217.","journal-title":"Discrete Math."},{"key":"CR6","unstructured":"W. H. Cunningham andJ. Green-Kr\ufffdtki: A separation algorithm for the matchable set polytope,Mathematical Programming, to appear."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0001-8708(86)90104-0","volume":"62","author":"A. Dress","year":"1986","unstructured":"A. Dress andT. Havel: Some combinatorial properties of discriminants in metric vector spaces,Adv. Math. 62 (1986), 285?312.","journal-title":"Adv. Math."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01580137","volume":"5","author":"F. D. J. Dunstan","year":"1973","unstructured":"F. D. J. Dunstan andD. J. A. Welsh: A greedy algorithm solving a certain class of linear programmes,Math. Programming 5 (1973), 338?353.","journal-title":"Math. Programming"},{"key":"CR9","first-page":"69","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds: Submodular functions, matroids, and certain polyhedra, in: R.K. Guy, et al (eds)Combinatorial Structures and their Applications, Gordon and Breach New York, (1970), pp. 69?87."},{"key":"CR10","first-page":"88","volume-title":"Combinatorial Structures and their Applications","author":"J. Edmonds","year":"1970","unstructured":"J. Edmonds andE. L. Johnson: Matching: a well-solved class of integer linear programs, in: R.K. Guy, et al (eds)Combinatorial Structures and their Applications, Gordon and Breach, New York, (1970) pp. 88?92."},{"key":"CR11","first-page":"264","volume":"11","author":"P. Erd?s","year":"1960","unstructured":"P. Erd?s andT. Gallai: Gr\ufffdfok el?\ufffdrt fok\ufffd pontokkal (Graphs with vertices of prescribed degrees),Mat. Lapok 11 (1960), 264?274.","journal-title":"Mat. Lapok"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\ufffdtschel","year":"1981","unstructured":"M. Gr\ufffdtschel, L. Lov\ufffdsz andA. Schrijver: The ellipsoid method and its consequences in combinatorial optimization,Combinatorica 1 (1981), 169?197.","journal-title":"Combinatorica"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0166-218X(90)90023-6","volume":"26","author":"S. N. Kabadi","year":"1990","unstructured":"S. N. Kabadi andR. Chandrasekaran: On totally dual integral systems,Discrete Applied Math. 26 (1990), 87?104.","journal-title":"Discrete Applied Math."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/0095-8956(73)90037-3","volume":"15","author":"M. Koren","year":"1973","unstructured":"M. Koren: Extreme degree sequences of simple graphs,J. Combinatorial Theory B15 (1973), 213?224.","journal-title":"J. Combinatorial Theory B"},{"key":"CR15","unstructured":"M. Nakamura: A characterization of those polytopes in which the greedy algorithm works, abstract,13th International Symposium on Mathematical Programming, Tokyo, Japan, 1988."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0167-6377(87)90027-7","volume":"6","author":"Q. Ning","year":"1987","unstructured":"Q. Ning: On separation and adjacency problems for perfectly matchable subgraph polytopes of a graph,Operations Research Letters 6 (1987), 239?242.","journal-title":"Operations Research Letters"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/0024-3795(89)90470-9","volume":"114\/115","author":"U. N. Peled","year":"1989","unstructured":"U. N. Peled andM. K. Srinivasan: The polytope of degree sequences,Linear Algebra and Its Applications 114\/115 (1989), 349?377.","journal-title":"Linear Algebra and Its Applications"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF01589420","volume":"42","author":"L. Qi","year":"1988","unstructured":"L. Qi: Directed submodularity, ditroids, and directed submodular flows,Math. Programming 42 (1988), 579?599.","journal-title":"Math. Programming"}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205074.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01205074\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01205074","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T17:06:06Z","timestamp":1556730366000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01205074"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,9]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1991,9]]}},"alternative-id":["BF01205074"],"URL":"https:\/\/doi.org\/10.1007\/bf01205074","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,9]]}}}