{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:07:49Z","timestamp":1758823669777},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1995,1,1]],"date-time":"1995-01-01T00:00:00Z","timestamp":788918400000},"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":6772,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Combinatorics"],"published-print":{"date-parts":[[1995,1]]},"DOI":"10.1016\/0195-6698(95)90085-3","type":"journal-article","created":{"date-parts":[[2004,8,5]],"date-time":"2004-08-05T04:27:27Z","timestamp":1091680047000},"page":"17-21","source":"Crossref","is-referenced-by-count":7,"title":["Even and odd pairs in linegraphs of bipartite graphs"],"prefix":"10.1016","volume":"16","author":[{"given":"Stefan","family":"Hougardy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0195-6698(95)90085-3_BIB1","series-title":"Wiss. Z. Martin-Luther-Univ. Halle-Wittenberg Math.-Natur. Reihe","first-page":"114","article-title":"F\u00e4rbung von Graphen, deren s\u00e4mtliche bzw. deren ungerade Kreise starr sind","author":"Berge","year":"1961"},{"key":"10.1016\/0195-6698(95)90085-3_BIB2","first-page":"57","article-title":"Strongly perfect graphs","volume":"21","author":"Berge","year":"1984","journal-title":"Ann. Discr. Math."},{"key":"10.1016\/0195-6698(95)90085-3_BIB3_1","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0012-365X(91)90098-M","article-title":"On the complexity of testing for odd holes and induced odd paths","volume":"90","author":"Bienstock","year":"1991","journal-title":"Discr. Math."},{"key":"10.1016\/0195-6698(95)90085-3_BIB3_2","first-page":"109","article-title":"On the complexity of testing for odd holes and induced odd paths","volume":"102","author":"Bienstock","year":"1992","journal-title":"Discr. Math."},{"key":"10.1016\/0195-6698(95)90085-3_BIB4","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0095-8956(85)90049-8","article-title":"Star-cutsets and perfect graphs","volume":"39","author":"Chv\u00e1tal","year":"1985","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0195-6698(95)90085-3_BIB5","author":"Harary","year":"1969"},{"key":"10.1016\/0195-6698(95)90085-3_BIB6","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/BF01788666","article-title":"Slim graphs","volume":"5","author":"Hertz","year":"1989","journal-title":"Graph Combin."},{"key":"10.1016\/0195-6698(95)90085-3_BIB7","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1016\/0095-8956(87)90045-1","article-title":"Alternating orientation and alternating colouration of perfect graphs","volume":"42","author":"Ho\u00e0ng","year":"1987","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0195-6698(95)90085-3_BIB8","series-title":"Perfekte Graphen, Diplomarbeit","author":"Hougardy","year":"1991"},{"key":"10.1016\/0195-6698(95)90085-3_BIB9","unstructured":"S. Hougardy, Even Pairs and the Strong Perfect Graph Conjecture, to appear in Discr. Math."},{"key":"10.1016\/0195-6698(95)90085-3_BIB10","series-title":"On planar strict quasi-parity graphs","author":"Linhares","year":"1994"},{"key":"10.1016\/0195-6698(95)90085-3_BIB11","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/S0195-6698(87)80037-9","article-title":"A new property of critical imperfect graphs and some consequences","volume":"8","author":"Meyniel","year":"1987","journal-title":"Europ. J. Combin."},{"key":"10.1016\/0195-6698(95)90085-3_BIB12","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0095-8956(89)90024-5","article-title":"A new conjecture about minimal imperfect graphs","volume":"47","author":"Meyniel","year":"1989","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0195-6698(95)90085-3_BIB13","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/0095-8956(79)90047-9","article-title":"The validity of the Strong Perfect-Graph Conjecture for (K4 \u2212 e)-free graphs","volume":"26","author":"Parthasarathy","year":"1979","journal-title":"J. Combin. Theory, Ser. B"},{"key":"10.1016\/0195-6698(95)90085-3_BIB14","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 graph H from its line graph G","volume":"2","author":"Roussopoulos","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0195-6698(95)90085-3_BIB15","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0095-8956(87)90048-7","article-title":"Coloring perfect K4 \u2212 e-free graphs","volume":"42","author":"Tucker","year":"1987","journal-title":"J. Combin. Theory, Ser. B"}],"container-title":["European Journal of Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900853?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0195669895900853?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T05:34:37Z","timestamp":1549344877000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0195669895900853"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["0195669895900853"],"URL":"https:\/\/doi.org\/10.1016\/0195-6698(95)90085-3","relation":{},"ISSN":["0195-6698"],"issn-type":[{"value":"0195-6698","type":"print"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}