Sciweavers

CORR
2004
Springer

Coloring Meyniel graphs in linear time

13 years 3 months ago
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.
Benjamin Lévêque, Frédé
Added 17 Dec 2010
Updated 17 Dec 2010
Type Journal
Year 2004
Where CORR
Authors Benjamin Lévêque, Frédéric Maffray
Comments (0)