Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

A strong stable set in a graph $G$ is a stable set that contains a vertex of every maximal clique of $G$. A Meyniel obstruction is an odd circuit with at least five vertices and at most one chord. Given a graph $G$ and a vertex $v$ of $G$, we give a polytime algorithm to find either a strong stable set containing $v$ or a Meyniel obstruction in $G$. This can then be used to find in any graph, a clique and colouring of the same size or a Meyniel obstruction.

[1]  Henry Meyniel.  The Graphs Whose Odd Cycles have at Least two Chords , 1984 .

[2]  Alain Hertz,et al.  A fast algorithm for coloring Meyniel graphs , 1990, J. Comb. Theory, Ser. B.

[3]  Florian Roussel,et al.  Holes and Dominoes in Meyniel Graphs , 1999, Int. J. Found. Comput. Sci..

[4]  F. Roussel,et al.  An O(n2) algorithm to color Meyniel graphs , 2001, Discret. Math..

[5]  Chính T. Hoàng,et al.  On a conjecture of Meyniel , 1987, J. Comb. Theory, Ser. B.

[6]  Benjamin Lévêque,et al.  Coloring Meyniel graphs in linear time , 2005, Electron. Notes Discret. Math..

[7]  M. Burlet,et al.  Polynomial algorithm to recognize a Meyniel graph , 1984 .

[8]  L. Lovász,et al.  Polynomial Algorithms for Perfect Graphs , 1984 .