关注我们：

solidot新版网站常见问题，请点击这里查看。

DP-3-coloring of some planar graphs. (arXiv:1802.09312v2 [math.CO] UPDATED)

来源于:arXiv
In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability. 查看全文>>