Jean-Christophe Godin

activity

20102022

most citedExtended core and choosability of a graph

2 citations · 4 across the 7 of their papers we have counts for

collaborators

8 papers

math.CO2022

On List Coloring with Separation of the Complete Graph and Set System Intersections

Jean-Christophe Godin, Rémi Grisot, Olivier Togni

We consider the following list coloring with separation problem: Given a graph $G$ and integers $a, b$ , find the largest integer $c$ such that for any list assignment $L$ of $G$ wit…

math.CO2020

Choosability with Separation of Cycles and Outerplanar Graphs

Jean-Christophe Godin, Olivier Togni

We consider the following list coloring with separation problem of graphs: Given a graph $G$ and integers $a, b$ , find the largest integer $c$ such that for any list assignment $L$ …

math.CO2018

New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version)

Jean-Christophe Godin, Olivier Togni

A $(a, b)$ -coloring of a graph $G$ associates to each vertex a $b$ -subset of a set of $a$ colors in such a way that the color-sets of adjacent vertices are disjoint. We define gener…

math.CO2014

Free choosability of the cycle

Yves Aubry, Jean-Christophe Godin, Olivier Togni

A graph $G$ is free $(a, b)$ -choosable if for any vertex $v$ with $b$ colors assigned and for any list of colors of size $a$ associated with each vertex $u \neq = v$ , 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 $G$ with a given list assignment $L$ on the vertices, we give an algebraical description of the set of all weights $w$ such that $G$ is $(L, w)$ -colorable, called permis…

math.CO2011

Every triangle-free induced subgraph of the triangular lattice is $(5 m, 2 m)$ -choosable

Yves Aubry, Jean-Christophe Godin, Olivier Togni

A graph $G$ is $(a, b)$ -choosable if for any color list of size $a$ associated with each vertex, one can choose a subset of $b$ colors such that adjacent vertices are colored with d…

cs.DM2010★ 2 cited

Extended core and choosability of a graph

Yves Aubry, Godin Jean-Christophe, Togni Olivier

A graph $G$ is $(a, b)$ -choosable if for any color list of size $a$ associated with each vertices, one can choose a subset of $b$ colors such that adjacent vertices are colored with…

math.CO2010★ 1 cited

Choosability of a weighted path and free-choosability of a cycle

Yves Aubry, Jean-Christophe Godin, Olivier Togni

A graph $G$ with a list of colors $L (v)$ and weight $w (v)$ for each vertex $v$ is $(L, w)$ -colorable if one can choose a subset of $w (v)$ colors from $L (v)$ for each vertex $v$ , suc…

On List Coloring with Separation of the Complete Graph and Set System Intersections

Choosability with Separation of Cycles and Outerplanar Graphs

New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version)

Free choosability of the cycle

Vectorial solutions to list multicoloring problems on graphs

Every triangle-free induced subgraph of the triangular lattice is (5m,2m)-choosable

Extended core and choosability of a graph

Choosability of a weighted path and free-choosability of a cycle

Every triangle-free induced subgraph of the triangular lattice is $(5 m, 2 m)$ -choosable