Sufficient conditions on planar graphs to have a relaxed DP-$3$-colorability
Combinatorics
2018-03-12 v1
Abstract
It is known that DP-coloring is a generalization of a list coloring in simple graphs and many results in list coloring can be generalized in those of DP-coloring. In this work, we introduce a relaxed DP-coloring which is a generalization if a relaxed list coloring. We also shows that every planar graph without -cycles or -cycles is DP--colorable. It follows immediately that is -choosable.
Cite
@article{arxiv.1803.03527,
title = {Sufficient conditions on planar graphs to have a relaxed DP-$3$-colorability},
author = {Pongpat Sittitrai and Kittikorn Nakprasit},
journal= {arXiv preprint arXiv:1803.03527},
year = {2018}
}
Comments
arXiv admin note: substantial text overlap with arXiv:1801.06760