Selective graph coloring in some special classes of graphs

Authors:
Marc Demange;Jérôme Monnot;Petrica Pop;Bernard Ries
Affiliations:
ESSEC Business School, Paris, France;LAMSADE, Université Paris-Dauphine, France;Universitatea de Nord, Baia Mare, Romania;LAMSADE, Université Paris-Dauphine, France
Venue:
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Year:
2012

Citing 13
Cited 0

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
The Complexity of Multiterminal Cuts

SIAM Journal on Computing
A threshold of ln n for approximating set cover

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Some simplified NP-complete problems

STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
On the complexity of approximating tsp with neighborhoods and related problems

Computational Complexity
A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding

Computers and Operations Research
On the parameterized complexity of multiple-interval graph problems

Theoretical Computer Science
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints

Discrete Applied Mathematics
Note: Complexity of two coloring problems in cubic planar bipartite mixed graphs

Discrete Applied Mathematics
Graph Coloring for class scheduling

AICCSA '10 Proceedings of the ACS/IEEE International Conference on Computer Systems and Applications - AICCSA 2010
Empires make cartography hard: the complexity of the empire colouring problem

WG'11 Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the selective graph coloring problem. Given an integer k≥1 and a graph G=(V,E) with a partition V1,…,Vp of V, it consists in deciding whether there exists a set V* in G such that |V*∩Vi|=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.