相关论文: WDM and Directed Star Arboricity

Classical problems in hypergraph coloring theory are to estimate the minimum number of edges, $m_2(r)$ (respectively, $m^\ast_2(r)$), in a non-$2$-colorable $r$-uniform (respectively, $r$-uniform and simple) hypergraph. The best currently…

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

We consider two decomposition problems in directed graphs. We say that a digraph is $k$-bounded for some $k \in \mathbb{Z}_{\geq 1}$ if each of its connected components contains at most $k$ arcs. For the first problem, a directed linear…

A cut in a digraph $D=(V,A)$ is a set of arcs $\{uv \in A: u\in U, v\notin U\}$, for some $U\subseteq V$. It is known that the arc set $A$ is covered by $k$ cuts if and only if it admits a $k$-coloring such that no two consecutive arcs $uv,…

We provide novel deterministic distributed vertex coloring algorithms. As our main result, we give a deterministic distributed algorithm to compute a $(\Delta+1)$-coloring of an $n$-node graph with maximum degree $\Delta$ in…

Many of the tools developed for the theory of tree-decompositions of graphs do not work for directed graphs. In this paper we show that some of the most basic tools do work in the case where the model digraph is a directed path. Using these…

Let $D$ be a digraph, let $p \geq 1$ be an integer, and let $f: V(D) \to \mathbb{N}_0^p$ be a vector function with $f=(f_1,f_2,\ldots,f_p)$. We say that $D$ has an $f$-partition if there is a partition $(D_1,D_2,\ldots,D_p)$ into induced…

In the List $k$-Coloring problem we are given a graph whose every vertex is equipped with a list, which is a subset of $\{1,\ldots,k\}$. We need to decide if $G$ admits a proper coloring, where every vertex receives a color from its list.…

The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $\chi_{D}(G)$ of $G$ is…

For positive integers $j\ge k$, an $L(j,k)$-labeling of a digraph $D$ is a function $f$ from $V(D)$ into the set of nonnegative integers such that $|f(x)-f(y)|\ge j$ if $x$ is adjacent to $y$ in $D$ and $|f(x)-f(y)|\ge k$ if $x$ is of…

We study weighted edge coloring of graphs, where we are given an undirected edge-weighted general multi-graph $G := (V, E)$ with weights $w : E \rightarrow [0, 1]$. The goal is to find a proper weighted coloring of the edges with as few…

A rooted tree $\vec{R}$ is a rooted subtree of a tree $T$ if the tree obtained by replacing the directed edges of $\vec{R}$ by undirected edges is a subtree of $T$. We study the problem of assigning minimum number of colors to a given set…

An edge coloring of a graph $G$ is \emph{woody} if no cycle is monochromatic. The \emph{arboricity} of a graph $G$, denoted by $\arb (G)$, is the least number of colors needed for a woody coloring of $G$. A coloring of $G$ is \emph{strongly…

For planar graphs, we consider the problems of \emph{list edge coloring} and \emph{list total coloring}. Edge coloring is the problem of coloring the edges while ensuring that two edges that are adjacent receive different colors. Total…

{\emph A star edge-coloring} of a graph is a proper edge-coloring without bichromatic paths and cycles of length four. In this paper, we consider the list version of this coloring and prove that the list star chromatic index of every…

The dichromatic number of an oriented graph is the minimum size of a partition of its vertices into acyclic induced subdigraphs. We prove that oriented graphs with no induced directed path on six vertices and no triangle have bounded…

Given positive integers $k \leq m$ and a graph $G$, a family of lists $L = \{L(v) : v \in V(G)\}$ is said to be a random $(k,m)$-list-assignment if for every $v \in V(G)$ the list $L(v)$ is a subset of $\{1, \ldots, m\}$ of size $k$, chosen…

The dichromatic number $\vec{\chi}(D)$ of a digraph $D$ is the smallest $k$ for which it admits a $k$-coloring where every color class induces an acyclic subgraph. Inspired by Hadwiger's conjecture for undirected graphs, several groups of…

A star edge coloring of a graph is a proper edge coloring with no $2$-colored path or cycle of length four. The star chromatic index $\chi'_{st}(G)$ of $G$ is the minimum number $t$ for which $G$ has a star edge coloring with $t$ colors. We…

In this paper we study the oriented vertex and arc coloring problem on edge series-parallel digraphs (esp-digraphs) which are related to the well known series-parallel graphs. Series-parallel graphs are graphs with two distinguished…