solidot新版网站常见问题,请点击这里查看。
消息
本文已被查看2266次
A Sufficient condition for DP-4-colorability. (arXiv:1709.09809v1 [math.CO])
来源于:arXiv
DP-coloring of a simple graph is a generalization of list coloring, and also
a generalization of signed coloring of signed graphs. It is known that for each
$k \in \{3, 4, 5, 6\}$, every planar graph without $C_k$ is 4-choosable.
Furthermore, Jin, Kang, and Steffen \cite{JKS} showed that for each $k \in \{3,
4, 5, 6\}$, every signed planar graph without $C_k$ is signed 4-choosable. In
this paper, we show that for each $k \in \{3, 4, 5, 6\}$, every planar graph
without $C_k$ is 4-DP-colorable, which is an extension of the above results. 查看全文>>