research
∙
09/29/2021
2-distance list (Δ+2)-coloring of planar graphs with girth at least 10
Given a graph G and a list assignment L(v) for each vertex of v of G. A ...
share
research
∙
09/24/2021
2-distance (Δ+2)-coloring of sparse graphs
A 2-distance k-coloring of a graph is a proper k-coloring of the vertice...
research
∙
06/07/2021
2-distance 4-coloring of planar subcubic graphs with girth at least 21
A 2-distance k-coloring of a graph is a proper vertex k-coloring where v...
research
∙
03/22/2021
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...
research
∙
09/11/2020