Dominator coloring of a graph is a proper (vertex) coloring with the property that every vertex
is either alone in its color class or adjacent to all vertices of at least one color class. A …

Purpose The purpose of this paper is to assess the application of graph coloring and
domination to solve the airline-scheduling problem. Graph coloring and domination in …

The dominated coloring of a graph $ G $ is a proper coloring of $ G $ such that each color
class is dominated by at least one vertex. The minimum number of colors needed for a …

A class domination coloring (also called cd-Coloring or dominated coloring) of a graph is a
proper coloring in which every color class is contained in the neighborhood of some vertex …

The dominated coloring (dom-coloring) of a graph G is a proper coloring such that each
color class is dominated by at least one vertex. The dominated chromatic number (dom …

In this paper, we are interested in four proper vertex colorings of graphs, with additional
domination property. In the dominator colorings, strong colorings and strict strong colorings …

A proper vertex coloring of G is a dominated coloring if each color class is dominated by at
least one vertex of G, that is, for each color class there exists a vertex that is adjacent to all …

A partition of the vertex set of a graph G into k independent sets V 1, V 2,…, V k is called a k-
class domination coloring (k-cd-coloring) of G if for every V i, 1≤ i≤ k, there exists a vertex xi …

For a commutative ring R, even elements in R as vertices and two distinct vertices xi, yj∈ R
are adjacent iff xiyj= 0 or yjxi= 0, then the graph is known as an even prime graph. In …

A domination coloring of a graph G is a proper vertex coloring of G, such that each vertex of
G dominates at least one color class (possibly its own class), and each color class is …