{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T09:59:40Z","timestamp":1760954380441},"reference-count":8,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1990,12,1]],"date-time":"1990-12-01T00:00:00Z","timestamp":660009600000},"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":8264,"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":[[1990,12]]},"DOI":"10.1016\/0166-218x(90)90141-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"165-170","source":"Crossref","is-referenced-by-count":10,"title":["A note on line digraphs and the directed max-cut problem"],"prefix":"10.1016","volume":"29","author":[{"given":"V.","family":"Chv\u00e1tal","sequence":"first","affiliation":[]},{"given":"C.","family":"Ebenegger","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(90)90141-X_BIB1","series-title":"Beitr\u00e4ge zur Graphentheorie","first-page":"17","article-title":"On derived graphs and digraphs","author":"Beineke","year":"1968"},{"key":"10.1016\/0166-218X(90)90141-X_BIB2","series-title":"Konstruktive Methoden der Finiten Nichtlinearen Optimierung","first-page":"9","article-title":"Some remarks on conflict graphs of quadratic pseudo-boolean functions","volume":"55","author":"Benzaken","year":"1980"},{"key":"10.1016\/0166-218X(90)90141-X_BIB3","series-title":"Rutcor Res. Rept. 8\u201388","article-title":"Recognition of quadratic graphs and adjoints of bidirected graphs","author":"Crama","year":"1988"},{"key":"10.1016\/0166-218X(90)90141-X_BIB4","series-title":"Rapport Technique RT-13","article-title":"Polynomial recognition algorithm of perfect 3-chromatic K4 \u29f9 {e}-free graphs","author":"Fonlupt","year":"1986"},{"key":"10.1016\/0166-218X(90)90141-X_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(90)90141-X_BIB6","series-title":"Topics on Perfect Graphs","first-page":"325","article-title":"Polynomial algorithms for perfect graphs","volume":"21","author":"Gr\u00f6tschel","year":"1984"},{"key":"10.1016\/0166-218X(90)90141-X_BIB7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(81)90020-1","article-title":"Weakly bipartite graphs and the max-cut problem","volume":"1","author":"Gr\u00f6tschel","year":"1981","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(90)90141-X_BIB8","series-title":"Proceedings of the Fourth Southeastern Conference on Combinatorics, Graph Theory and Computing","first-page":"3","article-title":"Coverings and colorings of hypergraphs","author":"Lov\u00e1sz","year":"1973"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090141X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9090141X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:57:53Z","timestamp":1555120673000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9090141X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,12]]},"references-count":8,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1990,12]]}},"alternative-id":["0166218X9090141X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(90)90141-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1990,12]]}}}