Exploring the complexity boundary between coloring and list-coloring

被引：0

作者：

Flavia Bonomo

Guillermo Durán

Javier Marenco

机构：

[1] Universidad de Buenos Aires,CONICET and Departamento de Computación, Facultad de Ciencias Exactas y Naturales

[2] Universidad de Chile,Departamento de Ingeniería Industrial, Facultad de Ciencias Físicas y Matemáticas

[3] Universidad de Buenos Aires,CONICET and Departamento de Matemática, Facultad de Ciencias Exactas y Naturales

[4] Universidad Nacional de General Sarmiento,Instituto de Ciencias

来源：

Annals of Operations Research | 2009年 / 169卷

关键词：

Coloring; Computational complexity; List-coloring;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

Many classes of graphs where the vertex coloring problem is polynomially solvable are known, the most prominent being the class of perfect graphs. However, the list-coloring problem is NP-complete for many subclasses of perfect graphs. In this work we explore the complexity boundary between vertex coloring and list-coloring on such subclasses of perfect graphs where the former admits polynomial-time algorithms but the latter is NP-complete. Our goal is to analyze the computational complexity of coloring problems lying “between” (from a computational complexity viewpoint) these two problems: precoloring extension, μ-coloring, and (γ,μ)-coloring.

引用

页码：3 / 16

页数：13

共 50 条

[1] Exploring the complexity boundary between coloring and list-coloring
Bonomo, Flavia
Duran, Guillermo
Marenco, Javier
[J]. ANNALS OF OPERATIONS RESEARCH, 2009, 169 (01) : 3 - 16
[2] Between coloring and list-coloring: μ-coloring
Bonomo, Flavia
Cecowski Palacio, Mariano
[J]. ARS COMBINATORIA, 2011, 99 : 383 - 398
[3] On the complexity of a restricted list-coloring problem
Dror, M
Finke, G
Gravier, S
Kubiak, W
[J]. DISCRETE MATHEMATICS, 1999, 195 (1-3) : 103 - 109
[4] On the complexity of a restricted list-coloring problem
[J]. Discrete Math, 1-3 (103-109):
[5] On a list-coloring problem
Gravier, S
Maffray, F
Mohar, B
[J]. DISCRETE MATHEMATICS, 2003, 268 (1-3) : 303 - 308
[6] Some (in)tractable Parameterizations of Coloring and List-Coloring
Arora, Pranav
Banik, Aritra
Paliwal, Vijay Kumar
Raman, Venkatesh
[J]. FRONTIERS IN ALGORITHMICS (FAW 2018), 2018, 10823 : 126 - 139
[7] Differences between the list-coloring and DP-coloring for planar graphs
Abe, Toshiki
[J]. DISCRETE MATHEMATICS, 2021, 344 (08)
[8] List-coloring embedded graphs
Dvorak, Zdenek
Kawarabayashi, Ken-ichi
[J]. PROCEEDINGS OF THE TWENTY-FOURTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA 2013), 2013, : 1004 - 1012
[9] On list-coloring outerplanar graphs
Hutchinson, Joan P.
[J]. JOURNAL OF GRAPH THEORY, 2008, 59 (01) : 59 - 74
[10] List-coloring the square of a subcubic graph
Cranston, Daniel W.
Kim, Seog-Jin
[J]. JOURNAL OF GRAPH THEORY, 2008, 57 (01) : 65 - 87

← 1 2 3 4 5 →