12,415 research outputs found
On DP-Coloring of Digraphs
DP-coloring is a relatively new coloring concept by Dvo\v{r}\'ak and Postle
and was introduced as an extension of list-colorings of (undirected) graphs. It
transforms the problem of finding a list-coloring of a given graph with a
list-assignment to finding an independent transversal in an auxiliary graph
with vertex set . In this paper, we
extend the definition of DP-colorings to digraphs using the approach from
Neumann-Lara where a coloring of a digraph is a coloring of the vertices such
that the digraph does not contain any monochromatic directed cycle.
Furthermore, we prove a Brooks' type theorem regarding the DP-chromatic number,
which extends various results on the (list-)chromatic number of digraphs.Comment: 23 pages, 6 figure
List Defective Colorings: Distributed Algorithms and Applications
The distributed coloring problem is at the core of the area of distributed
graph algorithms and it is a problem that has seen tremendous progress over the
last few years. Much of the remarkable recent progress on deterministic
distributed coloring algorithms is based on two main tools: a) defective
colorings in which every node of a given color can have a limited number of
neighbors of the same color and b) list coloring, a natural generalization of
the standard coloring problem that naturally appears when colorings are
computed in different stages and one has to extend a previously computed
partial coloring to a full coloring.
In this paper, we introduce \emph{list defective colorings}, which can be
seen as a generalization of these two coloring variants. Essentially, in a list
defective coloring instance, each node is given a list of colors
together with a list of defects
such that if is colored with color , it is allowed to have at
most neighbors with color .
We highlight the important role of list defective colorings by showing that
faster list defective coloring algorithms would directly lead to faster
deterministic -coloring algorithms in the LOCAL model. Further, we
extend a recent distributed list coloring algorithm by Maus and Tonoyan [DISC
'20]. Slightly simplified, we show that if for each node it holds that
then
this list defective coloring instance can be solved in a
communication-efficient way in only communication rounds. This
leads to the first deterministic -coloring algorithm in the
standard CONGEST model with a time complexity of , matching the best time complexity in the LOCAL model up to a
factor
Rainbow Subgraphs in Edge-colored Complete Graphs -- Answering two Questions by Erd\H{o}s and Tuza
An edge-coloring of a complete graph with a set of colors is called
completely balanced if any vertex is incident to the same number of edges of
each color from . Erd\H{o}s and Tuza asked in whether for any graph
on edges and any completely balanced coloring of any sufficiently
large complete graph using colors contains a rainbow copy of . This
question was restated by Erd\H{o}s in his list of ``Some of my favourite
problems on cycles and colourings''. We answer this question in the negative
for most cliques by giving explicit constructions of respective
completely balanced colorings. Further, we answer a related question concerning
completely balanced colorings of complete graphs with more colors than the
number of edges in the graph .Comment: 8 page
- …