|
|
|
|
|
Wenjun Li, Xueying Yang, Chao Xu and Yongjie Yang
In the directed co-graph edge-deletion problem, we are given a directed graph and an integer k, and the question is whether we can delete, at most, k edges so that the resulting graph is a directed co-graph. In this paper, we make two minor contributions...
ver más
|
|
|
|
|
|
|
|
|
|
|
Frank Gurski, Dominique Komander and Carolin Rehs
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph ??=(??,...
ver más
|
|
|
|
|
|