Florian Roussel

According to our database, Florian Roussel authored at least 12 papers between 1997 and 2009.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2009

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution.

Florian Roussel, Irena Rusu, Henri Thuillier

Discret. Math., 2009

2002

Loose vertices in <i>C</i>₄-free Berge graphs.

Igor Parfenoff, Florian Roussel, Irena Rusu

Discret. Math., 2002

2001

About Skew Partitions in Minimal Imperfect Graphs.

Florian Roussel, P. Rubio

J. Comb. Theory, Ser. B, 2001

An O(<i>n</i>²) algorithm to color Meyniel graphs.

Florian Roussel, Irena Rusu

Discret. Math., 2001

New classes of perfectly orderable graphs.

Jean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier

Discret. Math., 2001

2000

Recognizing i-triangulated graphs in O(mn) time.

Florian Roussel, Irena Rusu

Inf. Process. Lett., 2000

1999

A Linear Algorithm to Color <i>i</i>-Triangulated Graphs.

Florian Roussel, Irena Rusu

Inf. Process. Lett., 1999

On Graphs with Limited Number of P₄-Partners.

Florian Roussel, Irena Rusu, Henri Thuillier

Int. J. Found. Comput. Sci., 1999

Holes and Dominoes in Meyniel Graphs.

Florian Roussel, Irena Rusu

Int. J. Found. Comput. Sci., 1999

Triangulated Neighbourhoods in <i>C</i>₄-Free Berge Graphs.

Igor Parfenoff, Florian Roussel, Irena Rusu

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1997

On P₄-tidy graphs.

Vassilis Giakoumakis, Florian Roussel, Henri Thuillier

Discret. Math. Theor. Comput. Sci., 1997

Scattering number and modular decomposition.

Vassilis Giakoumakis, Florian Roussel, Henri Thuillier

Discret. Math., 1997