Colorings and orientations of graphs, Combinatorica, vol.12, pp.125-134, 1992. ,
Every planar map is four colorable, Contemporary Mathematics, vol.89, 1989. ,
Recognizing graphs close to bipartite graphs, Proc. MFCS 2017, vol.83, pp.1-70 ,
URL : https://hal.archives-ouvertes.fr/hal-02527078
On colouring the nodes of a network, Mathematical Proceedings of the Cambridge Philosophical Society, vol.37, pp.194-197, 1941. ,
Some structural properties of planar graphs and their applications to 3-choosability, Discrete Mathematics, vol.312, pp.362-373, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00375596
Hard coloring problems in low degree planar bipartite graphs, Discrete Applied Mathematics, vol.154, pp.1960-1965, 2006. ,
Coloring graphs with forbidden induced subgraphs, Proc. ICM, vol.IV, pp.291-302, 2014. ,
Filling the complexity gaps for colouring planar and bounded degree graphs, Proc. IWOCA 2015, vol.9538, pp.100-111 ,
URL : https://hal.archives-ouvertes.fr/lirmm-01481412
Partitioning a triangle-free planar graph into a forest and a forest of bounded degree, European Journal of Combinatorics, vol.66, pp.81-94, 2017. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01233461
List-coloring embedded graphs, Proc. SODA 2013, pp.1004-1012 ,
, Planar graphs without 3, vol.309, pp.5899-5904, 2009.
List-coloring apex-minor-free graphs ,
Uniquely colourable graphs and the hardness of colouring graphs of large girth, Combinatorics, Probability & Computing, vol.7, pp.375-386, 1998. ,
Choosability in graphs, Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State Univ, pp.125-157, 1979. ,
A complexity dichotomy for the coloring of sparse graphs, Journal of Graph Theory, vol.73, pp.85-102, 2013. ,
URL : https://hal.archives-ouvertes.fr/lirmm-00736468
Some simplified NP-complete graph problems, Proc. STOC 1974, pp.47-63 ,
, Choosability on H-free graphs, vol.113, pp.107-110, 2013.
A survey on the computational complexity of colouring graphs with forbidden subgraphs, Journal of Graph Theory, vol.84, pp.331-363, 2017. ,
Closing complexity gaps for coloring problems on H-free graphs, Information and Computation, vol.237, pp.204-214, 2014. ,
The complexity of planar graph choosability, Discrete Mathematics, vol.159, pp.119-130, 1996. ,
Precoloring extension with fixed color bound, Acta Mathematica Universitatis Comenianae, vol.62, pp.139-153, 1993. ,
, Algorithmic complexity of list colourings, vol.50, pp.297-302, 1994.
The 4-choosability of plane graphs without 4-cycles, Journal of Combinatorial Theory, Series B, vol.76, pp.117-126, 1999. ,
Colouring graphs when the number of colours is almost the maximum degree, Journal of Combinatorial Theory, Series B, vol.109, pp.134-195, 2014. ,
A note on the not 3-choosability of some families of planar graphs, Information Processing Letters, vol.99, pp.68-71, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00307136
Bordeaux 3-color conjecture and 3-choosability, Discrete Mathematics, vol.306, pp.573-579, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00306480
Every planar graph is 5-choosable, Journal of Combinatorial Theory, Series B, vol.62, pp.180-181, 1994. ,
3-List-coloring planar graphs of girth 5, Journal of Combinatorial Theory, Series B, vol.64, pp.101-107, 1995. ,
Color-critical graphs on a fixed surface, Journal of Combinatorial Theory, Series B, vol.70, pp.67-100, 1997. ,
Coloring the vertices of a graph in prescribed colors, Metody Diskret. Anal. v. Teorii Kodov i Shem, vol.101, issue.29, pp.3-10, 1976. ,
Vertex colorings with given colors, Diskret. Analiz, vol.29, pp.3-10, 1976. ,
List colourings of planar graphs, Discrete Mathematics, vol.120, pp.215-219, 1993. ,
A not 3-choosable planar graph without 3-cycles, Discrete Mathematics, vol.146, pp.325-328, 1995. ,
A non-3-choosable planar graph without cycles of length 4 and 5, Discrete Mathematics, vol.307, pp.1013-1015, 2007. ,
On 3-colorable non-4-choosable planar graphs, Journal of Graph Theory, vol.24, pp.233-235, 1997. ,
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable, Discrete Mathematics, vol.310, pp.147-158, 2010. ,
, Discrete Applied Mathematics, vol.159, pp.232-239, 2011.
A smaller planar graph without 4-, 5-cycles and intersecting triangles that is not 3-choosable, Information Processing Letters, vol.108, pp.87-89, 2008. ,