{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T17:36:57Z","timestamp":1702575417553},"reference-count":14,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)00081-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"141-154","source":"Crossref","is-referenced-by-count":5,"title":["Polyhedral characterizations and perfection of line graphs"],"prefix":"10.1016","volume":"81","author":[{"given":"Dasong","family":"Cao","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00081-4_bib1","first-page":"299","article-title":"Graphe repr\u00e9sentatif des art\u02c6es d'un multigraphe","volume":"52","author":"Bermond","year":"1973","journal-title":"J. Math. Pures Appl."},{"key":"10.1016\/S0166-218X(97)00081-4_bib2","article-title":"Topics in node packing and coloring","author":"Cao","year":"1995"},{"key":"10.1016\/S0166-218X(97)00081-4_bib3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.6028\/jres.069B.013","article-title":"Maximum matching and a polyhedron with 0\u20131 vertices","volume":"69","author":"Edmonds","year":"1965","journal-title":"J. Res. Nat. Bur. Standards B"},{"key":"10.1016\/S0166-218X(97)00081-4_bib4","series-title":"Computers and Intractibility: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00081-4_bib5","series-title":"Geometric Algorithms and Combinatorial Optimization","author":"Gr\u00f6tschel","year":"1988"},{"key":"10.1016\/S0166-218X(97)00081-4_bib6","series-title":"Selected Topics in Graph Theory I","article-title":"Line graphs and line digraphs","author":"Hemminger","year":"1978"},{"key":"10.1016\/S0166-218X(97)00081-4_bib7","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0024-3795(77)90027-1","article-title":"On graphs whose least eigenvalue exceeds-1-\u221a2","volume":"16","author":"Hoffman","year":"1977","journal-title":"Linear Algebra Appl."},{"key":"10.1016\/S0166-218X(97)00081-4_bib8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BF01589347","article-title":"A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles","volume":"20","author":"Hsu","year":"1981","journal-title":"Math. Programm."},{"key":"10.1016\/S0166-218X(97)00081-4_bib9","series-title":"Matching Theory","author":"Lov\u00e1sz","year":"1986"},{"key":"10.1016\/S0166-218X(97)00081-4_bib10","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1057\/jors.1992.71","article-title":"A strong cutting plane\/branch-and-bound algorithm for node packing","volume":"43","author":"Nemhauser","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(97)00081-4_bib11","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0166-218X(97)00081-4_bib12","article-title":"Faces of matching polyhedra","author":"Pulleyblank","year":"1973"},{"key":"10.1016\/S0166-218X(97)00081-4_bib13","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1016\/0020-0190(73)90029-X","article-title":"A max{m, n} algorithm for determining the graphH from its line graphG","volume":"2","author":"Roussopoudos","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0166-218X(97)00081-4_bib14","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01593791","article-title":"Line perfect graphs","volume":"12","author":"Trotter","year":"1977","journal-title":"Math. Programm."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000814?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000814?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:49Z","timestamp":1556131849000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000814"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":14,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97000814"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00081-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}