Planar Graphs with the Distance of 6<sup>-</sup>-Cycles at Least 2 from Each Other Are DP-3-Colorable
DP-coloring as a generalization of list coloring was introduced by Dvořák and Postle recently. In this paper, we prove that every planar graph in which the distance between 6<inline-formula><math display="inline"><semantics><msup><mrow></mrow><mo>−...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2020-12-01
|
| Series: | Mathematics |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2227-7390/9/1/70 |