Meyniel graph

In graph theory, a Meyniel graph is a graph in which every odd cycle of length five or more has at least two chords (edges connecting non-consecutive vertices of the cycle). The chords may be uncrossed (as shown in the figure) or they may cross each other, as long as there are at least two of them. The Meyniel graphs are named after Henri Meyniel (also known for Meyniel's conjecture), who proved that they are perfect graphs in 1976, long before the proof of the strong perfect graph theorem completely characterized the perfect graphs. The same result was independently discovered by . The Meyniel graphs are a subclass of the perfect graphs. Every induced subgraph of a Meyniel graph is another Meyniel graph, and in every Meyniel graph the size of a maximum clique equals the minimum number of colors needed in a graph coloring. Thus, the Meyniel graphs meet the definition of being a perfect graph, that the clique number equals the chromatic number in every induced subgraph. Meyniel graphs are also called the very strongly perfect graphs, because (as Meyniel conjectured and Hoàng proved) they can be characterized by a property generalizing the defining property of the strongly perfect graphs: in every induced subgraph of a Meyniel graph, every vertex belongs to an independent set that intersects every maximal clique. The Meyniel graphs contain the chordal graphs, the parity graphs, and their subclasses the interval graphs, distance-hereditary graphs, bipartite graphs, and line perfect graphs. Although Meyniel graphs form a very general subclass of the perfect graphs, they do not include all perfect graphs. For instance the house graph (a pentagon with only one chord) is perfect but is not a Meyniel graph. Meyniel graphs can be recognized in polynomial time, and several graph optimization problems including graph coloring that are NP-hard for arbitrary graphs can be solved in polynomial time for Meyniel graphs.