Florian Roussel - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2009

The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolutionFlorian Roussel, Irena Rusu, Henri Thuillier. DM, 309(20):6092-6113, 2009. [doi]

2002

Loose vertices in ::::C::::::4::-free Berge graphsIgor Parfenoff, Florian Roussel, Irena Rusu. DM, 258(1-3):137-160, 2002. [doi]

2001

New classes of perfectly orderable graphsJean-Luc Fouquet, Florian Roussel, P. Rubio, Henri Thuillier. DM, 236(1-3):95-109, 2001. [doi]

An O(::::n:::::::2:::) algorithm to color Meyniel graphsFlorian Roussel, Irena Rusu. DM, 235(1-3):107-123, 2001. [doi]

About Skew Partitions in Minimal Imperfect GraphsFlorian Roussel, P. Rubio. JCT, 83(2):171-190, 2001. [doi]

2000

Recognizing i-triangulated graphs in O(mn) timeFlorian Roussel, Irena Rusu. ipl, 76(3):141-147, 2000. [doi]

1999

Triangulated Neighbourhoods in ::::C::::::4::-Free Berge GraphsIgor Parfenoff, Florian Roussel, Irena Rusu. criwg 1999: 402-412 [doi]

On Graphs with Limited Number of P::4::-PartnersFlorian Roussel, Irena Rusu, Henri Thuillier. ijfcs, 10(1):103, 1999.

A Linear Algorithm to Color ::::i::::-Triangulated GraphsFlorian Roussel, Irena Rusu. ipl, 70(2):57-62, 1999. [doi]

Holes and Dominoes in Meyniel GraphsFlorian Roussel, Irena Rusu. ijfcs, 10(2):127-146, 1999.

1997

On P4-tidy graphsVassilis Giakoumakis, Florian Roussel, Henri Thuillier. dmtcs, 1(1):17-41, 1997. [doi]

Scattering number and modular decompositionVassilis Giakoumakis, Florian Roussel, Henri Thuillier. DM, 165-166:321-342, 1997. [doi]

Sign in or sign up to see more results.

runs on WebDSL