Defective DP-colorings of sparse simple graphs

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 paper...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete mathematics 2022-01, Vol.345 (1), p.112637, Article 112637
Hauptverfasser: Jing, Yifan, Kostochka, Alexandr, Ma, Fuhong, Xu, Jingwei
Format: Artikel
Sprache:eng
Schlagworte:
Defective coloring
DP-coloring
List coloring
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 paper we determine sharp bound on gDP(i,j,n) for each i≥3 and j≥2i+1 for infinitely many n.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2021.112637