The oriented chromatic number of an oriented graph G is the minimum order of an oriented graph H such that G admits a homomorphism to H. The oriented chromatic number of an undire...
A Meyniel graph is a graph in which every odd cycle of length at least five has two chords. We present a linear-time algorithm that colors optimally the vertices of a Meyniel grap...
An r-component connected coloring of a graph is a coloring of the vertices so that each color class induces a subgraph having at most r connected components. The concept has been w...
Benny Chor, Michael R. Fellows, Mark A. Ragan, Igo...
A defining set (of vertex coloring) of a graph G is a set of vertices S with an assignment of colors to its elements which has a unique completion to a proper coloring of G. We de...
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzb...
In this paper, we study the Minimum Sum Set Coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersectio...