adv

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

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.查看全文

Solidot 文章翻译

你的名字

留空匿名提交
你的Email或网站

用户可以联系你
标题

简单描述
内容