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

TL;DR

This paper proves that planar graphs lacking 4-cycles adjacent to triangles are DP-4-colorable, extending known results about their 4-choosability and DP-colorability.

Contribution

It establishes the DP-4-colorability of a new class of planar graphs, broadening understanding of graph coloring properties.

Findings

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

Extends previous results on 4-choosability and DP-colorability.

Provides new insights into the coloring of specific planar graph classes.

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.