2 citations · 4 across the 6 of their papers we have counts for
5 papers · 1 filter
-distance list -coloring of planar graphs with girth at least 10
Hoang La, Mickael Montassier
Given a graph and a list assignment for each vertex of of . A proper -list-coloring of is a function that maps every vertex to a color in such that…
-distance -coloring of sparse graphs
Hoang La, Mickael Montassier
A -distance -coloring of a graph is a proper -coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a -di…
Star coloring of sparse graphs
Yuehua Bu, Daniel W. Cranston, Mickaël Montassier +2
A proper coloring of the vertices of a graph is called a \emph{star coloring} if the union of every two color classes induces a star forest. The star chromatic number is t…
-distance -coloring of sparse graphs using the potential method
Hoang La, Mickael Montassier
A -distance -coloring of a graph is a proper -coloring of the vertices where vertices at distance at most 2 cannot share the same color. We prove the existence of a -di…
The chromatic number of 2-edge-colored and signed graphs of bounded maximum degree
Christopher Duffy, Fabien Jacques, Mickael Montassier +1
A 2-edge-colored graph or a signed graph is a simple graph with two types of edges. A homomorphism from a 2-edge-colored graph to a 2-edge-colored graph is a mapping $φ: V(…