
Efficient computation of the oriented chromatic number of recursively defined digraphs
Given some oriented graph G=(V,E), an oriented rcoloring for G is a par...
read it

Computing Directed Steiner Path Covers
In this article we consider the Directed Steiner Path Cover problem on d...
read it

Acyclic coloring of special digraphs
An acyclic rcoloring of a directed graph G=(V,E) is a partition of the ...
read it

Solutions for Subset Sum Problems with Special Digraph Constraints
The subset sum problem is one of the simplest and most fundamental NPha...
read it

On Characterizations for Subclasses of Directed CoGraphs
Undirected cographs are those graphs which can be generated from the si...
read it

Oriented coloring on recursively defined digraphs
Coloring is one of the most famous problems in graph theory. The colorin...
read it

Comparing Linear Width Parameters for Directed Graphs
In this paper we introduce the linear cliquewidth, linear NLCwidth, ne...
read it

Characterizations and Directed PathWidth of Sequence Digraphs
Computing the directed pathwidth of a directed graph is an NPhard prob...
read it

Computing directed pathwidth and directed treewidth of recursively defined digraphs
In this paper we consider the directed pathwidth and directed treewidt...
read it
Frank Gurski
is this you? claim profile