Results 1 
2 of
2
Coloring Meyniel graphs in linear time
 Cahiers Leibniz 105 (2004), accepted in Information Processing Letters, available on http://hal.ccsd.cnrs.fr/ccsd00001574
"... A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a lineartime algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size. 1 ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a lineartime algorithm that colors optimally the vertices of a Meyniel graph and finds a clique of maximum size. 1