Coloring Meyniel graphs in linear time

A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size.

• Type: Journal
• Year: 2004
• Where: CORR
• Authors: Benjamin Lévêque, Frédéric Maffray
• Keywords: CORR 2004, Education, Linear-Time Algorithm, Meyniel Graph, Odd Cycle