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 of a digraph is the minimum size of a partition o...
A (unit) disk graph is the intersection graph of closed (unit) disks in ...
Can every connected graph burn in ⌈√(n)⌉ steps? While this
conjecture re...
The dichromatic number of a digraph D is the minimum number of colors
ne...
In this paper, we investigate the complexity of Maximum Independent Set ...
We propose a polynomial-time algorithm which takes as input a finite set...