News
A graph G is said to have a dominator coloring if it has a proper coloring in which every vertex of the graph dominates all vertices of atleast one color class. The dominator chromatic number Xd (G) ...
We study the problem of finding a shortest path between two vertices in a directed graph. This is an important problem with many applications, including that of computing driving directions. We allow ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results