51 citations · 110 across the 15 of their papers we have counts for
3 papers · 1 filter
Precoloring co-Meyniel graphs
Vincent Jost, Benjamin Lévêque, Frédéric Maffray
The pre-coloring extension problem consists, given a graph and a subset of nodes to which some colors are already assigned, in finding a coloring of with the minimum number…
Coloring vertices of a graph or finding a Meyniel obstruction
Kathie Cameron, Jack Edmonds, Benjamin Lévêque +1
A Meyniel obstruction is an odd cycle with at least five vertices and at most one chord. A graph is Meyniel if and only if it has no Meyniel obstruction as an induced subgraph. Her…
Coloring Artemis graphs
Benjamin Lévêque, Frédéric Maffray, Bruce Reed +1
We consider the class A of graphs that contain no odd hole, no antihole, and no ``prism'' (a graph consisting of two disjoint triangles with three disjoint paths between them). We…