-
Improper choosability of graphs and maximum average degree
Improper choosability of planar graphs has been widely studied. In particular, Skrekovski investigated the smallest integer $g_k$ such that every planar graph of girth... -
On strong edge-colouring of subcubic graphs
International audience -
On backbone coloring of graphs
International audience -
Adjacent vertex-distinguishing edge coloring of graphs with maximum degree $\...
International audience -
2-distance coloring of sparse graphs
International audience -
On the maximum average degree and the incidence chromatic number of a graph
International audience
