20 citations · 99 across the 20 of their papers we have counts for
3 papers · 1 filter
Majority dominator colorings of graphs
Marcin Anholcer, Azam Sadat Emadi, Doost Ali Mojdeh
Let be a simple graph of order . A majority dominator coloring of a graph is proper coloring in which each vertex of the graph dominates at least half of one color class…
Mrs. Correct and Majority Colorings
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +3
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…
On b-acyclic chromatic number of a graph
Marcin Anholcer, Sylwia Cichacz, Iztok Peterin
Let be a graph. We introduce the acyclic b-chromatic number of as an analogue to the b-chromatic number of . An acyclic coloring of a graph is a map $c:V(G)\rightarr…