{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:49:20Z","timestamp":1778644160562,"version":"3.51.4"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"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":8963,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989]]},"DOI":"10.1016\/0166-218x(92)90273-d","type":"journal-article","created":{"date-parts":[[2002,12,10]],"date-time":"2002-12-10T21:10:39Z","timestamp":1039554639000},"page":"63-82","source":"Crossref","is-referenced-by-count":35,"title":["K\u00f6nig-Egerv\u00e1ry graphs, 2-bicritical graphs and fractional matchings"],"prefix":"10.1016","volume":"24","author":[{"given":"Jean-Marie","family":"Bourjolly","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William R.","family":"Pulleyblank","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(92)90273-D_BIB1","series-title":"Doctoral Dissertation","article-title":"Integral and fractional node-packings and pseudo-Boolean programming","author":"Bourjolly","year":"1986"},{"key":"10.1016\/0166-218X(92)90273-D_BIB2","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1007\/BFb0121007","article-title":"Node-weighted graphs having the K\u00f6nig-Egerv\u00e1ry property","volume":"22","author":"Bourjolly","year":"1984","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(92)90273-D_BIB3","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0012-365X(79)90066-9","article-title":"Independence numbers of graphs: An extension of the K\u00f6nig-Egerv\u00e1ry theorem","volume":"27","author":"Deming","year":"1979","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(92)90273-D_BIB4","doi-asserted-by":"crossref","first-page":"449","DOI":"10.4153\/CJM-1965-045-4","article-title":"Paths, trees and flowers","volume":"17","author":"Edmonds","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(92)90273-D_BIB5","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1137\/0603052","article-title":"Vertices belonging to all or to no maximum stable sets of a graph","volume":"3","author":"Hammer","year":"1982","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/0166-218X(92)90273-D_BIB6","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(92)90273-D_BIB7","series-title":"Hypergraph Seminar 1972","article-title":"Minimax theorems for hypergraphs","volume":"411","author":"Lov\u00e1sz","year":"1972"},{"key":"10.1016\/0166-218X(92)90273-D_BIB8","first-page":"279","article-title":"A note on factor-critical graphs","volume":"7","author":"Lov\u00e1sz","year":"1972","journal-title":"Studia Sci. Math. Hungar."},{"key":"10.1016\/0166-218X(92)90273-D_BIB9","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02579346","article-title":"Ear-decompositions of matching-covered graphs","volume":"3","author":"Lov\u00e1sz","year":"1983","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(92)90273-D_BIB10","article-title":"Matching Theory","volume":"29","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/0166-218X(92)90273-D_BIB11","series-title":"Doctoral Dissertation","article-title":"On dual integrality, min-max equalities and algorithms in combinatorial linear programs","author":"Korach","year":"1982"},{"key":"10.1016\/0166-218X(92)90273-D_BIB12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","article-title":"Vertex packings: Structural properties and algorithms","volume":"8","author":"Nemhauser","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90273-D_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01593772","article-title":"On the integer valued variables in the linear vertex packing problem","volume":"12","author":"Picard","year":"1977","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90273-D_BIB14","series-title":"Tech. Rept. EP75-R-47","article-title":"Vertex packings (VLP): reductions through alternate labelling","author":"Picard","year":"1975"},{"key":"10.1016\/0166-218X(92)90273-D_BIB15","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01588228","article-title":"Minimum node-covers and 2-bicritical graphs","volume":"17","author":"Pulleyblank","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(92)90273-D_BIB16","series-title":"Hypergraph Seminar","first-page":"214","article-title":"Facets of 0\u20131 matching polyhedra","author":"Pulleyblank","year":"1974"},{"key":"10.1016\/0166-218X(92)90273-D_BIB17","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1016\/0095-8956(79)90085-6","article-title":"A characterization of the graphs in which the transversal number equals the matching number","volume":"27","author":"Sterboul","year":"1979","journal-title":"J. Combin. Theory Ser. B"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290273D?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9290273D?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:56Z","timestamp":1555134956000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9290273D"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989]]}},"alternative-id":["0166218X9290273D"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(92)90273-d","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989]]}}}