{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T22:54:28Z","timestamp":1776725668261,"version":"3.51.2"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1977,12,1]],"date-time":"1977-12-01T00:00:00Z","timestamp":249782400000},"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":[[1977,12]]},"DOI":"10.1007\/bf01593791","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T16:13:01Z","timestamp":1114704781000},"page":"255-259","source":"Crossref","is-referenced-by-count":48,"title":["Line perfect graphs"],"prefix":"10.1007","volume":"12","author":[{"suffix":"Jr.","given":"L. E.","family":"Trotter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF01593791_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0095-8956(72)90002-0","volume":"13","author":"M.L. Balinski","year":"1972","unstructured":"M.L. Balinski, \u201cEstablishing the matching polytope\u201d,Journal of Combinatorial Theory 13 (1972) 1\u201313.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF01593791_CR2","unstructured":"C. Berge, \u201cF\u00e4rbung von graphen, deren s\u00e4mtliche bzw. deren ungerade kreise starr sind\u201d,Wissenschaftliche Zeitschrift der Martin-Luther Universit\u00e4t Halle-Wittenberg Mathematisch-Naturwissenschaftliche Reihe (1961) 114."},{"key":"BF01593791_CR3","volume-title":"Graph theory and theoretical physics","author":"C. Berge","year":"1967","unstructured":"C. Berge, \u201cSome classes of perfect graphs\u201d, in: F. Harary, ed.,Graph theory and theoretical physics (Academic Press, New York, 1967)."},{"key":"BF01593791_CR4","volume-title":"Graphs and hypergraphs","author":"C. Berge","year":"1973","unstructured":"C. Berge,Graphs and hypergraphs (North-Holland, New York, 1973)."},{"key":"BF01593791_CR5","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","volume":"18","author":"V. Chv\u00e1tal","year":"1975","unstructured":"V. Chv\u00e1tal, \u201cOn certain polytopes associated with graphs\u201d,Journal of Combinatorial Theory B18 (1975) 138\u2013154.","journal-title":"Journal of Combinatorial Theory B"},{"key":"BF01593791_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, \u201cPaths, trees, and flowers\u201d,Canadian Journal of Mathematics 17 (1965) 449\u2013467.","journal-title":"Canadian Journal of Mathematics"},{"key":"BF01593791_CR7","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, 1)-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":"BF01593791_CR8","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d,Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"BF01593791_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D.R. Fulkerson","year":"1972","unstructured":"D.R. Fulkerson, \u201cAnti-blocking polyhedra\u201d,Journal of Combinatorial Theory 12 (1972) 50\u201371.","journal-title":"Journal of Combinatorial Theory"},{"key":"BF01593791_CR10","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","volume-title":"Mathematical programming","author":"D.R. Fulkerson","year":"1973","unstructured":"D.R. Fulkerson, \u201cOn the perfect graph theorem\u201d, in: T.C. Hu and S.M. Robinson, eds.,Mathematical programming (Academic Press, New York, 1973) pp. 69\u201376."},{"key":"BF01593791_CR11","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph theory","author":"F. Harary","year":"1969","unstructured":"F. Harary,Graph theory (addison-Wesley, Reading, MA, 1969)."},{"key":"BF01593791_CR12","volume-title":"Theorie der endlichen und unendlichen graphen","author":"D. K\u00f6nig","year":"1950","unstructured":"D. K\u00f6nig,Theorie der endlichen und unendlichen graphen (Chelsea, New York, 1950)."},{"key":"BF01593791_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, \u201cA characterization of perfect graphs\u201d,Journal of Combinatorial Theory B13 (1972) 95\u201398.","journal-title":"Journal of Combinatorial Theory B"},{"key":"BF01593791_CR14","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, \u201cNormal hypergraphs and the perfect graph conjecture\u201d,Discrete Mathematics 2 (1972) 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"BF01593791_CR15","unstructured":"K.R. Parthasarathy and G. Ravindra, \u201cThe strong perfect-graph conjecture is true forK\n1\u20133-free graphs\u201d,Journal of Combinatorial Theory, to appear."},{"key":"BF01593791_CR16","volume-title":"Faces of matching polyhedra","author":"W. Pulleyblank","year":"1973","unstructured":"W. Pulleyblank, \u201cFaces of matching polyhedra\u201d, Doctoral Dissertation, Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario (1973)."},{"key":"BF01593791_CR17","volume-title":"\u201cSolution characteristics and algorithms for the vertex packing problem\u201d, Tech. Rept. No. 168","author":"L.E. Trotter Jr.","year":"1973","unstructured":"L.E. Trotter, Jr., \u201cSolution characteristics and algorithms for the vertex packing problem\u201d, Tech. Rept. No. 168, Department of Operations Research, Cornell University, Ithaca, NY (1973)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01593791\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593791","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01593791.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T15:27:08Z","timestamp":1581953228000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01593791"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,12]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1977,12]]}},"alternative-id":["BF01593791"],"URL":"https:\/\/doi.org\/10.1007\/bf01593791","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,12]]}}}