On the complexity of the selective graph coloring problem in some special classes of graphs

被引：23
|
作者：
Demange, Marc [1 ,2 ]
Monnot, Jerome [3 ,4 ]
Pop, Petrica [5 ]
Ries, Bernard [3 ,4 ]
机构：
[1] ESSEC Business Sch, Paris, France
[2] LAMSADE UMR 7243, Paris, France
[3] CNRS, LAMSADE UMR 7243, F-75700 Paris, France
[4] Univ Paris 09, PSL, F-75775 Paris 16, France
[5] Tech Univ Cluj Napoca, North Univ Ctr Baia Mare, Cluj Napoca, Romania
来源：
THEORETICAL COMPUTER SCIENCE | 2014年 / 540卷
关键词：
Computational complexity; Approximation algorithms; PTAS; Scheduling; Bipartite graphs; Split graphs; Complete q-partite graphs; Clustering; CHORDAL GRAPHS;
D O I：
10.1016/j.tcs.2013.04.018
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we consider the selective graph coloring problem. Given an integer k >= 1 and a graph G = (V, E) with a partition V-1, ...., V-p of V, it consists in deciding whether there exists a set V* in G such that vertical bar V* boolean AND V-i vertical bar n = 1 for all i is an element of {1, ..., p}, and such that the graph induced by V* is k-colorable. We investigate the complexity status of this problem in various classes of graphs. (C) 2013 Elsevier B.V. All rights reserved.
引用
收藏
页码：89 / 102
页数：14
相关论文
共 50 条
  • [1] On the complexity of the black-and-white coloring problem on some classes of perfect graphs
    Kloks, Ton
    Poon, Sheung-Hung
    Tsai, Feng-Ren
    Wang, Yue-Li
    [J]. THEORETICAL COMPUTER SCIENCE, 2014, 532 : 51 - 63
  • [2] Complexity classification of the edge coloring problem for a family of graph classes
    [J]. Malyshev, Dmitriy S. (dsmalyshev@rambler.ru), 1600, Walter de Gruyter GmbH (27):
  • [3] On some applications of the selective graph coloring problem
    Demange, Marc
    Ekim, Tinaz
    Ries, Bernard
    Tanasescu, Cerasela
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 240 (02) : 307 - 314
  • [4] On the minimum and maximum selective graph coloring problems in some graph classes
    Demange, Marc
    Ekim, Tinaz
    Ries, Bernard
    [J]. DISCRETE APPLIED MATHEMATICS, 2016, 204 : 77 - 89
  • [5] Graph modification problem for some classes of graphs
    Sritharan, R.
    [J]. JOURNAL OF DISCRETE ALGORITHMS, 2016, 38-41 : 32 - 37
  • [6] The complexity of the defensive domination problem in special graph classes
    Ekim, Tinaz
    Farley, Arthur M.
    Proskurowski, Andrzej
    [J]. DISCRETE MATHEMATICS, 2020, 343 (02)
  • [7] Equitable Edge Coloring of Splitting Graph of Some Classes of Wheel Graphs
    Jagannathan, M.
    Vivin, Vernold J.
    Vivik, Veninstine J.
    [J]. ARS COMBINATORIA, 2020, 151 : 211 - 220
  • [8] Complexity of Fall Coloring for Restricted Graph Classes
    Lauri, Juho
    Mitillos, Christodoulos
    [J]. COMBINATORIAL ALGORITHMS, IWOCA 2019, 2019, 11638 : 352 - 364
  • [9] Complexity of Fall Coloring for Restricted Graph Classes
    Juho Lauri
    Christodoulos Mitillos
    [J]. Theory of Computing Systems, 2020, 64 : 1183 - 1196
  • [10] Complexity of Fall Coloring for Restricted Graph Classes
    Lauri, Juho
    Mitillos, Christodoulos
    [J]. THEORY OF COMPUTING SYSTEMS, 2020, 64 (07) : 1183 - 1196
12345