1 citations · 1 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
Polynomial Cases for the Vertex Coloring Problem
T. Karthick, Frédéric Maffray, Lucas Pastor
The computational complexity of the Vertex Coloring problem is known for all hereditary classes of graphs defined by forbidding two connected five-vertex induced subgraphs, except…
math.CO2017
Decomposition techniques applied to the Clique-Stable set Separation problem
Nicolas Bousquet, Aurélie Lagoutte, Frédéric Maffray +1
In a graph, a Clique-Stable Set separator (CS-separator) is a family of cuts (bipartitions of the vertex set) such that for every clique and every stable set …