{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:26:21Z","timestamp":1648661181630},"reference-count":8,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":6225,"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":[[1996,7]]},"DOI":"10.1016\/0166-218x(95)00065-y","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T13:35:45Z","timestamp":1027604145000},"page":"293-302","source":"Crossref","is-referenced-by-count":4,"title":["The parity path problem on some subclasses of perfect graphs"],"prefix":"10.1016","volume":"68","author":[{"given":"C.R.","family":"Satyan","sequence":"first","affiliation":[]},{"given":"C.Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00065-Y_BIB1","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/BF01931279","article-title":"Efficient reduction for path problems on circular-arc graphs","volume":"31","author":"Arikati","year":"1991","journal-title":"BIT"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0166-218X(93)90230-L","article-title":"A linear algorithm for group path problem on chordal graphs","author":"Arikati","year":"1990"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB3","series-title":"Topics on Perfect Graphs","volume":"21","year":"1984"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB4","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":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00065-Y_BIB5","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB6","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1145\/23005.31330","article-title":"Recognizing planar perfect graphs","volume":"34","author":"Hsu","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB7","article-title":"Chord-free path problems on interval graphs","author":"Manacher","year":"1991"},{"key":"10.1016\/0166-218X(95)00065-Y_BIB8","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1137\/0214048","article-title":"On comparability and permutation graphs","volume":"14","author":"Spinard","year":"1985","journal-title":"SIAM J. Comput."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500065Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X9500065Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T14:27:29Z","timestamp":1556116049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X9500065Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["0166218X9500065Y"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00065-y","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}