-
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...
03/22/2021 ∙ by Hoang La, et al. ∙
0
∙
share
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...
09/11/2020 ∙ by Christopher Duffy, et al. ∙
0
∙
share
read it
