{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T02:28:49Z","timestamp":1649039329043},"reference-count":12,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2001,10,1]],"date-time":"2001-10-01T00:00:00Z","timestamp":1001894400000},"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":4307,"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":[[2001,10]]},"DOI":"10.1016\/s0166-218x(00)00290-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:23:54Z","timestamp":1027617834000},"page":"255-260","source":"Crossref","is-referenced-by-count":0,"title":["Recognition of quasi-Meyniel graphs"],"prefix":"10.1016","volume":"113","author":[{"given":"Celina M.H.","family":"de Figueiredo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kristina","family":"Vu\u0161kovi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(00)00290-0_BIB1","first-page":"123","article-title":"Les probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge","year":"1960","journal-title":"Publ. Inst. Statist. Univ. Paris"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB2","doi-asserted-by":"crossref","unstructured":"D. Bienstock, On the complexity of testing for odd holes and induced odd paths, Discrete Math. 90 (1991) 85\u201392. Corrigendum in Discrete Math. 102 (1992) 109.","DOI":"10.1016\/0012-365X(91)90098-M"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB3","first-page":"225","article-title":"Polynomial algorithm to recognize a Meyniel graph","volume":"21","author":"Burlet","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00290-0_BIB4","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BF01196132","article-title":"Universally signable graphs","volume":"17","author":"Conforti","year":"1997","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB5","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/(SICI)1097-0118(199904)30:4<289::AID-JGT4>3.0.CO;2-3","article-title":"Even and odd holes in cap-free graphs","volume":"30","author":"Conforti","year":"1999","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB6","doi-asserted-by":"crossref","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor and K. Vu\u0161kovi\u0107, Finding an even hole in a graph, in: 38th Annual Symp. on Foundations of Computer Science, Miami Beach, FL, October 1997. IEEE, pp. 480\u2013485.","DOI":"10.1109\/SFCS.1997.646136"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB7","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor, K. Vu\u0161kovi\u0107, Even-hole free graphs, Part I: decomposition, Part II: recognition algorithm, preprint, 1997, J. Graph Theory, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00290-0_BIB8","unstructured":"M. Conforti, G. Cornu\u00e9jols, A. Kapoor, K. Vu\u0161kovi\u0107, Triangle-free graphs that are signable without even holes, preprint, 1996, submitted for publication."},{"key":"10.1016\/S0166-218X(00)00290-0_BIB9","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0095-8956(90)90078-E","article-title":"A fast algorithm for colouring Meyniel graphs","volume":"50","author":"Hertz","year":"1990","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB10","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1016\/0095-8956(91)90003-3","article-title":"Short-chorded and perfect graphs","volume":"51","author":"Lubiw","year":"1991","journal-title":"J. Combin. Theory Ser. B"},{"key":"10.1016\/S0166-218X(00)00290-0_BIB11","first-page":"115","article-title":"The graphs whose odd cycles have at least two chords","volume":"21","author":"Meyniel","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1016\/S0166-218X(00)00290-0_BIB12","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1142\/S0129054199000113","article-title":"Holes and dominos in Meyniel graphs","volume":"10","author":"Roussel","year":"1999","journal-title":"Internat. J. Found. Comput. Sci."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002900?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X00002900?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T11:19:00Z","timestamp":1578914340000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X00002900"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,10]]},"references-count":12,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2001,10]]}},"alternative-id":["S0166218X00002900"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(00)00290-0","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2001,10]]}}}