{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T05:52:32Z","timestamp":1698213152784},"reference-count":18,"publisher":"Wiley","issue":"7","license":[{"start":{"date-parts":[[2006,10,6]],"date-time":"2006-10-06T00:00:00Z","timestamp":1160092800000},"content-version":"vor","delay-in-days":4357,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1994,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A kernel of a directed graph is a set of vertices <jats:italic>K<\/jats:italic> that is both absorbant and independent (i.e., every vertex not in <jats:italic>K<\/jats:italic> is the origin of an arc whose extremity is in <jats:italic>K<\/jats:italic>, and no arc of the graph has both endpoints in <jats:italic>K<\/jats:italic>). In 1983, Meyniel conjectured that any perfect graph, directed in such a way that every circuit of length three uses two reversible arcs, must have a kernel. This conjecture was proved for parity graphs. In this paper, we extend that result and prove that Meyniel's conjecture holds for all graphs in which every odd cycle has two chords.<\/jats:p>","DOI":"10.1002\/jgt.3190180706","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T16:20:03Z","timestamp":1181233203000},"page":"705-711","source":"Crossref","is-referenced-by-count":3,"title":["On the orientation of meyniel graphs"],"prefix":"10.1002","volume":"18","author":[{"given":"Mostaffa","family":"Blidia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Duchet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Maffray","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,6]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"123","article-title":"Le probl\u00e8mes de coloration en th\u00e9orie des graphes","volume":"9","author":"Berge C.","year":"1960","journal-title":"Publ. Inst. Stat. Univ. Paris"},{"key":"e_1_2_1_3_2","volume-title":"Graphs","author":"Berge C.","year":"1985"},{"key":"e_1_2_1_4_2","volume-title":"Topics on Perfect Graphs (Annals of Discrete Mathematics 21","author":"Berge C.","year":"1984"},{"key":"e_1_2_1_5_2","unstructured":"C.BergeandP.Duchet S\u00e9minaire MSH Paris January (1983)."},{"key":"e_1_2_1_6_2","unstructured":"C.BergeandP.Duchet Kernels and perfect graphs. Submitted for publication."},{"key":"e_1_2_1_7_2","volume-title":"Proceedings of the Burnside\u2010Raspail Meeting (Barbados 1986","author":"Berge C.","year":"1987"},{"key":"e_1_2_1_8_2","unstructured":"M.Blidia Kernels in parity digraphs with an orientation condition. Submitted for publication."},{"key":"e_1_2_1_9_2","unstructured":"M.Blidia Contribution \u00e0 l'\u00e9tude des noyaux dans les graphs. Thesis University of Paris 6 (1984)."},{"key":"e_1_2_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579405"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(89)90070-1"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-5060(08)70041-4"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(87)90016-5"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(84)90131-6"},{"key":"e_1_2_1_15_2","unstructured":"F.Maffray Kernels in perfect line\u2010graphs.RUTCORResearch Report 34\u201388 Rutgers University New Jersey 1988. (AlsoJ. Combinat. Theory B to appear)."},{"key":"e_1_2_1_16_2","unstructured":"F.Maffray Sur l'existence de noyaux dans les graphes parafaits. Thesis University of Paris 6 (1984)."},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(86)90095-6"},{"key":"e_1_2_1_18_2","unstructured":"H.Meyniel S\u00e9minaire MSH Paris (1983)."},{"key":"e_1_2_1_19_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0012-365X(76)80008-8"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190180706","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190180706","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T17:48:33Z","timestamp":1698169713000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190180706"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,11]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[1994,11]]}},"alternative-id":["10.1002\/jgt.3190180706"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190180706","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,11]]}}}