In this paper we study the oriented vertex and arc coloring problem on e...
We investigate structural and algorithmic advantages of a directed versi...
Given some oriented graph G=(V,E), an oriented r-coloring for G is a
par...
In this article we consider the Directed Steiner Path Cover problem on
d...
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the
...
The subset sum problem is one of the simplest and most fundamental NP-ha...
Undirected co-graphs are those graphs which can be generated from the si...
Coloring is one of the most famous problems in graph theory. The colorin...