News
Let D be a digraph. The competition graph of D is the graph having the same vertex set with D and having an edge joining two different vertices if and only if they have at least one common ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results