{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:25:56Z","timestamp":1777994756432,"version":"3.51.4"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":[[1989,12]]},"DOI":"10.1007\/bf02125345","type":"journal-article","created":{"date-parts":[[2005,9,14]],"date-time":"2005-09-14T18:43:33Z","timestamp":1126723413000},"page":"321-337","source":"Crossref","is-referenced-by-count":44,"title":["The perfectly Matchable Subgraph Polytope of an arbitrary graph"],"prefix":"10.1007","volume":"9","author":[{"given":"E.","family":"Balas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W. R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02125345_CR1","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0095-8956(71)90041-4","volume":"B 10","author":"I. Anderson","year":"1971","unstructured":"I. Anderson, Perfect matchings of a graph,J. Combin. Theory Ser.,B 10 (1971), 183\u2013186.","journal-title":"J. Combin. Theory Ser."},{"key":"BF02125345_CR2","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\u2013516.","journal-title":"Networks"},{"key":"BF02125345_CR3","unstructured":"E.Balas and W. R.Pulleyblank,The perfectly matchable subgraph polytope of an arbitrary graph, Research report 87470-OR, Inst. f\u00fcr Operations Research, Universit\u00e4t Bonn, 1987."},{"key":"BF02125345_CR4","unstructured":"W. H.Cunningham and J.Green-Krotki,A separation algorithm for the matchable set polytope, Research report, Inst. f\u00fcr Operations Research, Universit\u00e4t Bonn,1988."},{"key":"BF02125345_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69 B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Maximum matching and a polyhedron with (0,1) vertices,J. Res. Nat. Bur. Standards Sect. B,69 B (1965), 125\u2013130.","journal-title":"J. Res. Nat. Bur. Standards Sect. B"},{"key":"BF02125345_CR6","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","volume":"17","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, Paths, trees and flowers,Canad. J. Math.,17 (1965), 449\u2013467.","journal-title":"Canad. J. Math."},{"key":"BF02125345_CR7","volume-title":"Matching Theory","author":"L. Lov\u00e1sz","year":"1986","unstructured":"L. Lov\u00e1sz andM. D. Plummer,Matching Theory, North Holland, Amsterdam and Akad\u00e9miai Kiad\u00f3, Budapest 1986."},{"key":"BF02125345_CR8","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BFb0066196","volume-title":"Hypergraph Seminar","author":"W. Pulleyblank","year":"1974","unstructured":"W. Pulleyblank andJ. Edmonds, Facets of 1-matching potyhedra in C. Berge and D. K. Ray-Chaudhuri eds.,Hypergraph Seminar, Springer Verlag Berlin (1974), 214\u2013242."},{"key":"BF02125345_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1112\/jlms\/s1-22.2.107","volume":"22","author":"W. T. Tutte","year":"1947","unstructured":"W. T. Tutte, The factorization of linear graphs,J. London Math. Soc.,22 (1947), 107\u2013111.","journal-title":"J. London Math. Soc."}],"container-title":["Combinatorica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125345.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02125345\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02125345","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T01:31:09Z","timestamp":1557797469000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02125345"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":9,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["BF02125345"],"URL":"https:\/\/doi.org\/10.1007\/bf02125345","relation":{},"ISSN":["0209-9683","1439-6912"],"issn-type":[{"value":"0209-9683","type":"print"},{"value":"1439-6912","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}