research
∙
02/21/2022
Efficient computation of oriented vertex and arc colorings of special digraphs
In this paper we study the oriented vertex and arc coloring problem on e...
share
research
∙
12/26/2020
Efficient computation of the oriented chromatic number of recursively defined digraphs
Given some oriented graph G=(V,E), an oriented r-coloring for G is a par...
research
∙
12/22/2020
Computing Directed Steiner Path Covers
In this article we consider the Directed Steiner Path Cover problem on d...
research
∙
06/24/2020
Acyclic coloring of special digraphs
An acyclic r-coloring of a directed graph G=(V,E) is a partition of the ...
research
∙
04/09/2020
Solutions for Subset Sum Problems with Special Digraph Constraints
The subset sum problem is one of the simplest and most fundamental NP-ha...
research
∙
07/01/2019
On Characterizations for Subclasses of Directed Co-Graphs
Undirected co-graphs are those graphs which can be generated from the si...
research
∙
04/02/2019
Oriented coloring on recursively defined digraphs
Coloring is one of the most famous problems in graph theory. The colorin...
research
∙
12/17/2018
Comparing Linear Width Parameters for Directed Graphs
In this paper we introduce the linear clique-width, linear NLC-width, ne...
research
∙
11/06/2018
Characterizations and Directed Path-Width of Sequence Digraphs
Computing the directed path-width of a directed graph is an NP-hard prob...
research
∙
06/12/2018