arXiv:1712.08999 Abstract | arXiv Analytics

arXiv:1712.08999 [math.CO]Abstract References Reviews Resources

Planar graphs without 4-cycles adjacent to triangles are DP-4-colorable

Published 2017-12-25Version 1

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.

Comments: 15 pages, 5 figures

Categories: math.CO

Keywords: planar graphs, simple graph, correspondence

Related articles: Most relevant | Search more

arXiv:1801.06760 [math.CO] (Published 2018-01-21)

Planar graphs without triangles adjacent to $6$-cycles are DP-$4$-colorable

Pongpat Sittitrai, Kittikorn Nakprasit

arXiv:1910.10312 [math.CO] (Published 2019-10-23)

DP-coloring for planar graphs of diameter two

Jingran Qi, Danjun Huang, Weifan Wang, Stephen Finbow

arXiv:1508.03663 [math.CO] (Published 2015-08-14)

Planar Graphs of Girth at least Five are Square $(Δ+ 2)$-Choosable