{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:28:33Z","timestamp":1746523713657},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1979,12,1]],"date-time":"1979-12-01T00:00:00Z","timestamp":312854400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1979,12]]},"DOI":"10.1007\/bf01588228","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:20:45Z","timestamp":1114690845000},"page":"91-103","source":"Crossref","is-referenced-by-count":30,"title":["Minimum node covers and 2-bicritical graphs"],"prefix":"10.1007","volume":"17","author":[{"given":"W. R.","family":"Pulleyblank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"The design and analysis of computer algorithms","author":"A.V. Aho","year":"1974","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The design and analysis of computer algorithms (Addison-Wesley, Reading, MA, 1974)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M.L. Balinski","year":"1965","unstructured":"M.L. Balinski, \u201cInteger programming: Methods, uses, computation\u201d,Management Science 12 (1965) 253\u2013313.","journal-title":"Management Science"},{"key":"CR3","unstructured":"C. Berge, \u201cRegularizable graphs\u201d, in:Proceedings of the Calcutta conference on graph theory, Indian Statistical Institute, December 1976."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"643","DOI":"10.1137\/0206046","volume":"6","author":"V. Chv\u00e1tal","year":"1977","unstructured":"V. Chv\u00e1tal, \u201cDetermining the stability number of a graph\u201d,SIAM Journal of Computing 6 (1977) 643\u2013662.","journal-title":"SIAM Journal of Computing"},{"key":"CR5","unstructured":"G. Cornu\u00e9jols, \u201cDegree sequences of random graphs\u201d, Discussion Paper 7818, Center for Operations Research and Econometrics, University of Louvain (1978)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","volume":"69B","author":"J. Edmonds","year":"1965","unstructured":"J. Edmonds, \u201cMaximum matching and a polyhedron with 0\u20131 vertices\u201d,Journal of Research of the National Bureau of Standards 69B (1965) 125\u2013130.","journal-title":"Journal of Research of the National Bureau of Standards"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1090\/S0002-9904-1947-08785-1","volume":"53","author":"P. Erd\u00f6s","year":"1947","unstructured":"P. Erd\u00f6s, \u201cSome remarks on the theory of graphs\u201d,Bulletin of the American Mathematical Society 53 (1947) 292\u2013294.","journal-title":"Bulletin of the American Mathematical Society"},{"key":"CR8","volume-title":"Probabilistic methods in combinatorics","author":"P. Erd\u00f6s","year":"1974","unstructured":"P. Erd\u00f6s and J. Spencer,Probabilistic methods in combinatorics (Academic Press, New York, 1974)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1017\/S0305004100051124","volume":"77","author":"G.R. Grimmett","year":"1975","unstructured":"G.R. Grimmett and C.J.H. McDiarmid, \u201cOn colouring random graphs\u201d,Mathematical Proceedings of the Cambridge Philosophical Society 77 (1975) 313\u2013324.","journal-title":"Mathematical Proceedings of the Cambridge Philosophical Society"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R.M. Karp","year":"1972","unstructured":"R.M. Karp, \u201cReducibility among combinatorial problems\u201d, in: R.E. Miller and J.W. Thatcher, eds.,Complexity of computer computations (Plenum Press, New York, 1972, pp. 85\u2013104."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"C.J.H. McDiarmid, \u201cDetermining the chromatic number of a graph\u201d,SIAM Journal of Computing, to appear.","DOI":"10.1137\/0208001"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G.L. Nemhauser","year":"1975","unstructured":"G.L. Nemhauser and L.E. Trotter, \u201cVertex packings: Structural properties and algorithms\u201d,Mathematical Programming 8 (1975) 232\u2013248.","journal-title":"Mathematical Programming"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01593772","volume":"12","author":"J.C. Picard","year":"1977","unstructured":"J.C. Picard and M. Qu\u00e9yranne, \u201cOn the integer valued variables in the linear vertex packing problem\u201d,Mathematical Programming 12 (1977) 97\u2013101.","journal-title":"Mathematical Programming"},{"key":"CR14","unstructured":"J.C. Picard and M. Qu\u00e9yranne, \u201cVertex packings (VLP)\u2014reductions through alternate labelling\u201d, Tech. Rept. EP75-R-47, Ecole Polytechnique, University of Montreal (1975)."},{"key":"CR15","unstructured":"W.R. Pulleyblank, \u201cDual integrality inb-matching problems\u201d, Discussion Paper 7717, Center for Operations Research and Econometrics, University of Louvain (1977)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"314","DOI":"10.4153\/CJM-1952-028-2","volume":"4","author":"W.T. Tutte","year":"1952","unstructured":"W.T. Tutte, \u201cThe factors of graphs\u201d,Canadian Journal of Mathematics 4 (1952) 314\u2013328.","journal-title":"Canadian Journal of Mathematics"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588228.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01588228\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01588228","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:31:49Z","timestamp":1556897509000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01588228"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,12]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1979,12]]}},"alternative-id":["BF01588228"],"URL":"https:\/\/doi.org\/10.1007\/bf01588228","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,12]]}}}