Abstract
An interesting generalization of list coloring is so called DP-coloring (named after Dvořák and Postle). We study (i,j)-defective DP-colorings of simple graphs. Define gDP(i,j,n) to be the minimum number of edges in an n-vertex DP-(i,j)-critical graph. We prove sharp bounds on gDP(i,j,n) for i=1,2 and j≥2i for infinitely many n.
Original language | English (US) |
---|---|
Article number | 113899 |
Journal | Discrete Mathematics |
Volume | 347 |
Issue number | 5 |
DOIs | |
State | Published - May 2024 |
Keywords
- DP-coloring
- Defective coloring
- List coloring
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics