Planar Graphs Without 4-Cycles Adjacent to Triangles are DP-4-Colorable
- 3 Downloads
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 implies the two results above.
KeywordsColoring List-coloring DP-coloring Signed graph
This paper was written as part of Konkuk University’s research support program for its faculty on sabbatical leave in 2018 (S.-J. Kim). The second author is supported by Science Foundation of Jiangsu Normal University (18XLRX020), the National Natural Science Foundation of China (11871311) and the Shandong Provincial Natural Science Foundation of China (ZR2018BA010, ZR2018MA001).
- 3.Bernshteyn, A., Kostochka, A.: On differences between DP-coloring and list coloring. arXiv:1705.04883v2
- 8.Erdős, P., Rubin, A.L., Taylor, H.: Choosability in graphs. In: Proceedings of the West Coast Conference on Combinatorics, Graph Theory and Computing (Humboldt State University, Arcata, California, 1979), pp. 125–157, Congress. Numer., XXVI, Utilitas Mathematica Publishing Inc. Winnipeg, Manitoba (1980)Google Scholar
- 15.Vizing, V.G.: Vertex colorings with given colors (in Russian). Diskret. Analiz. 29, 3–10 (1976)Google Scholar