# DP-3-coloring of some planar graphs

## TL;DR

This paper proves that various classes of planar graphs are DP-3-colorable using a unified approach, extending known results on 3-choosability, and broadening understanding of graph coloring properties.

## Contribution

It introduces a unified method to establish DP-3-colorability for multiple classes of planar graphs, advancing the theoretical framework beyond existing 3-choosability results.

## Key findings

- Several classes of planar graphs are DP-3-colorable
- Unified approach simplifies proofs of DP-colorability
- Extends known 3-choosability results to DP-coloring

## Abstract

In this article, we use a unified approach to prove several classes of planar graphs are DP-$3$-colorable, which extend the corresponding results on $3$-choosability.