论文部分内容阅读
For any graph?G,?G?together with sufficiently many isolated vertices is the competition graph of some acyclic digraph. The competition number?k(G)?of a graph?G?is defined to be the smallest number of such isolated vertices. In general, it is hard to compu