2012 | OriginalPaper | Buchkapitel
Selective Graph Coloring in Some Special Classes of Graphs
verfasst von : Marc Demange, Jérôme Monnot, Petrica Pop, Bernard Ries
Erschienen in: Combinatorial Optimization
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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 |
V
*
∩
V
i
| = 1 for all
i
∈ {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.