Publications (4)
Coloring Square-free Berge Graphs
Maria Chudnovsky, Irene Lo, Frederic Maffray +2
We consider the class of Berge graphs that do not contain a chordless cycle of length . We present a purely graph-theoretical algorithm that produces an optimal coloring in poly…
Square-free graphs with no six-vertex induced path
T. Karthick, Frederic Maffray
We elucidate the structure of -free graphs by showing that every such graph either has a clique cutset, or a universal vertex, or belongs to several special classes of g…
Coloring graphs with no induced five-vertex path or gem
M. Chudnovsky, T. Karthick, P. Maceli +1
For a graph , let and respectively denote the chromatic number and clique number of . We give an explicit structural description of (,gem)-free graphs, a…
Transitive orientations in bull-reducible Berge graphs
Celina de Figueiredo, Frederic Maffray, Claudia Villela Maciel
A bull is a graph with five vertices and five edges , , , , . A graph is bull-reducible if no vertex of lies in two bulls. We prove that…