On Differences Between DP-Coloring and List Coloring

被引：0

作者：

Bernshteyn A.Y. ^{[1
]}

Kostochka A.V. ^{[1
,2
]}

机构：

[1] University of Illinois at Urbana-Champaign, Urbana, IL

[2] Sobolev Institute of Mathematics, Novosibirsk

来源：

Siberian Advances in Mathematics | 2019年 / 29卷 / 3期

基金：

美国国家科学基金会; 俄罗斯基础研究基金会;

关键词：

DP-coloring of a graph; edge coloring; list coloring of a graph;

D O I：

10.3103/S1055134419030039

中图分类号：

学科分类号：

摘要：

DP-coloring (also known as correspondence coloring) is a generalization of list coloring introduced recently by Dvořák and Postle [12]. Many known upper bounds for the list-chromatic number extend to the DP-chromatic number, but not all of them do. In this note we describe some properties of DP-coloring that set it aside from list coloring. In particular, we give an example of a planar bipartite graph with DP-chromatic number 4 and prove that the edge-DP-chromatic number of a d-regular graph with d ⩾ 2 is always at least d + 1. © 2019, Allerton Press, Inc.

引用

页码：183 / 189

页数：6

共 50 条

[31] List coloring and diagonal coloring for plane graphs of diameter two
Huang, Danjun
Wang, Yiqiao
Lv, Jing
Yang, Yanping
Wang, Weifan
APPLIED MATHEMATICS AND COMPUTATION, 2019, 363
[32] Faster Deterministic Distributed Coloring Through Recursive List Coloring
Kuhn, Fabian
PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 1244 - 1259
[33] Parameterized Pre-Coloring Extension and List Coloring Problems
Gutin, Gregory
Majumdar, Diptapriyo
Ordyniak, Sebastian
Wahlstrom, Magnus
37TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2020), 2020, 154
[34] Faster Deterministic Distributed Coloring Through Recursive List Coloring
Kuhn, Fabian
PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 1244 - 1259
[35] PARAMETERIZED PRE-COLORING EXTENSION AND LIST COLORING PROBLEMS
Gutin, Gregory
Majumdar, Diptapriyo
Ordyniak, Sebastian
Wahlstrom, Magnus
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (01) : 575 - 596
[36] Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles
Huan Zhou
Xuding Zhu
Graphs and Combinatorics, 2022, 38
[37] Pathwidth and nonrepetitive list coloring
Gagol, Adam
Joret, Gwenael
Kozik, Jakub
Micek, Piotr
ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (04):
[38] A list analogue of equitable coloring
Kostochka, AV
Pelsmajer, MJ
West, DB
JOURNAL OF GRAPH THEORY, 2003, 44 (03) : 166 - 177
[39] On list backbone coloring of graphs
Pimpasalee, Wannapol
Nakprasit, Keaitsuda Maneeruk
ARS COMBINATORIA, 2018, 140 : 123 - 134
[40] Multiple DP-Coloring of Planar Graphs Without 3-Cycles and Normally Adjacent 4-Cycles
Zhou, Huan
Zhu, Xuding
GRAPHS AND COMBINATORICS, 2022, 38 (06)

← 1 2 3 4 5 →