The following pages link to F. Roussel (Q190518):
Displaying 11 items.
- Recognizing \(i\)-triangulated graphs in \(O(mn)\) time (Q294870) (← links)
- The strong perfect graph conjecture: 40 years of attempts, and its resolution (Q1045106) (← links)
- Scattering number and modular decomposition (Q1356754) (← links)
- A linear algorithm to color \(i\)-triangulated graphs (Q1606929) (← links)
- Loose vertices in \(C_{4}\)-free Berge graphs (Q1850047) (← links)
- (Q3836509) (← links)
- (Q4944996) (← links)
- ON GRAPHS WITH LIMITED NUMBER OF P<sub>4</sub>-PARTNERS (Q5248994) (← links)
- HOLES AND DOMINOES IN MEYNIEL GRAPHS (Q5248996) (← links)
- An \(O(n^2)\) algorithm to color Meyniel graphs (Q5937923) (← links)
- New classes of perfectly orderable graphs (Q5959094) (← links)