-
2-distance (Δ+1)-coloring of sparse graphs using the potential method
A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
read it
-
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
A 2-edge-colored graph or a signed graph is a simple graph with two type...
read it

Mickael Montassier
is this you? claim profile