A sufficient condition for DP-4-colorability |
| |
Authors: | Seog-Jin Kim Kenta Ozeki |
| |
Institution: | 1. Department of Mathematics Education, Konkuk University, Republic of Korea;2. Faculty of Environment and Information Sciences, Yokohama National University, Japan |
| |
Abstract: | 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 , every planar graph without is 4-choosable. Furthermore, Jin et al. (2016) showed that for each , every signed planar graph without is signed 4-choosable. In this paper, we show that for each , every planar graph without is 4-DP-colorable, which is an extension of the above results. |
| |
Keywords: | Coloring List-coloring DP-coloring Signed graph |
本文献已被 ScienceDirect 等数据库收录! |
|