Graph coloring with cardinality constraints on the neighborhoods - Archive ouverte HAL Access content directly
Journal Articles Discrete Optimization Year : 2009

Graph coloring with cardinality constraints on the neighborhoods

Marie-Christine Costa
Christophe Picouleau
Bernard Ries
  • Function : Author

Abstract

Extensions and variations of the basic problem of graph coloring are introduced. It consists essentially in finding in a graph G a k-coloring, i.e., a partition V 1, ..., V k of the vertex set of G such that for some specified neighborhood ˜N (v) of each vertex v, the number of vertices in ˜N (v) \ V i is (at most) a given integer hi v. The complexity of some variations is discussed according to ˜N (v) which may be the usual neighbors, or the vertices at distance at most 2 or the closed neighborhood of v (v and its neighbors). Polynomially solvable cases are exhibited (in particular when G is a special tree).

Dates and versions

hal-00975361 , version 1 (08-04-2014)

Identifiers

Cite

Marie-Christine Costa, Dominique de Werra, Christophe Picouleau, Bernard Ries. Graph coloring with cardinality constraints on the neighborhoods. Discrete Optimization, 2009, 6 (4), pp.362--369. ⟨10.1016/j.disopt.2009.04.005⟩. ⟨hal-00975361⟩

Collections

ENSTA UMA_ENSTA
55 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More