1 citations · 2 across the 3 of their papers we have counts for
3 papers
math.CO2014
Free choosability of the cycle
Yves Aubry, Jean-Christophe Godin, Olivier Togni
A graph is free -choosable if for any vertex with colors assigned and for any list of colors of size associated with each vertex , the coloring can b…
math.CO2012★ 1 cited
Vectorial solutions to list multicoloring problems on graphs
Yves Aubry, Jean-Christophe Godin, Olivier Togni
For a graph with a given list assignment on the vertices, we give an algebraical description of the set of all weights such that is -colorable, called permis…
math.CO2010★ 1 cited
Choosability of a weighted path and free-choosability of a cycle
Yves Aubry, Jean-Christophe Godin, Olivier Togni
A graph with a list of colors and weight for each vertex is -colorable if one can choose a subset of colors from for each vertex , suc…