Defective DP-colorings of sparse simple graphs
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study (i, j)-defective DP-colorings of simple graphs. Let gDP(i, j, n)be the minimum number of edges in an n-vertex DP-(i, j)-critical graph. In this pap...
| Prif Awduron: | , , , |
|---|---|
| Fformat: | Journal article |
| Iaith: | English |
| Cyhoeddwyd: |
Elsevier
2021
|