Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable
Combinatorics
2017-12-27 v1
Abstract
DP-coloring (also known as correspondence coloring) of a simple graph is a generalization of list coloring. It is known that planar graphs without 4-cycles adjacent to triangles are 4-choosable, and planar graphs without 4-cycles are DP-4-colorable. In this paper, we show that planar graphs without 4-cycles adjacent to triangles are DP-4-colorable, which is an extension of the two results above.
Keywords
Cite
@article{arxiv.1712.08999,
title = {Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable},
author = {Seog-Jin Kim and Xiaowei Yu},
journal= {arXiv preprint arXiv:1712.08999},
year = {2017}
}
Comments
15 pages, 5 figures