The dichromatic number χ⃗(D) of a digraph D is the minimum size of
a par...
The dichromatic number of an oriented graph is the minimum size of a
par...
The dichromatic number χ⃗(G) of a digraph G is the least integer
k such ...
The dichromatic number (D) of a digraph D is the least integer k
such th...
The dichromatic number of a digraph is the minimum size of a partition o...
We characterize all digraphs H such that orientations of chordal graphs
...
We call a multigraph (k,d)-edge colourable if its edge set can be
partit...
We give four new proofs of the directed version of Brook's Theorem and a...
In this paper, we give bounds on the dichromatic number χ⃗(Σ)
of a surfa...
The dichromatic number of a digraph D is the minimum number of colors
ne...
The class of all even-hole-free graphs has unbounded tree-width, as it
c...
A set of n points in the plane which are not all collinear defines at le...
The first-fit coloring is a heuristic that assigns to each vertex, arriv...
We prove that for every n-vertex graph G, the extension complexity of th...
This paper is concerned with efficiently coloring sparse graphs in the
d...
Let W_t denote the wheel on t+1 vertices. We prove that for every intege...