The following pages link to Jean-Christophe Godin (Q293599):
Displayed 8 items.
- Free choosability of outerplanar graphs (Q293600) (← links)
- Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable (Q2636827) (← links)
- Vectorial solutions to list multicoloring problems on graphs (Q2915785) (← links)
- Choosability of a weighted path and free-choosability of a cycle (Q6218960) (← links)
- Free choosability of the cycle (Q6249682) (← links)
- New reducible configurations for graph multicoloring with application to the experimental resolution of McDiarmid-Reed's Conjecture (extended version) (Q6310741) (← links)
- Choosability with Separation of Cycles and Outerplanar Graphs (Q6348140) (← links)
- On List Coloring with Separation of the Complete Graph and Set System Intersections (Q6410050) (← links)