M. Burlet and J. Fonlupt, Polynomial algorithm to recognize a Meyniel graph, Topics on Perfect Graphs, pp.225-252, 1984.

M. Grötschel, L. Lovász, and A. Schrijver, Polynomial algorithms for perfect graphs, Topics on Perfect Graphs, pp.325-356, 1984.

A. Hertz, A fast algorithm for coloring Meyniel graphs, Journal of Combinatorial Theory, Series B, vol.50, issue.2, pp.231-240, 1990.
DOI : 10.1016/0095-8956(90)90078-E

B. Lévêque and F. Maffray, Coloring Meyniel graphs in linear time, preprint, 2004.

R. Roussel and I. Rusu, HOLES AND DOMINOES IN MEYNIEL GRAPHS, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.127-146, 1999.
DOI : 10.1142/S0129054199000113
URL : https://hal.archives-ouvertes.fr/hal-00442411

F. Roussel and I. Rusu, An O(n 2 ) algorithm to color Meyniel graphs, Discrete Math, pp.107-123, 2001.