Competition numbers of graphs with a sma
β
Suh-Ryung Kim; Fred S. Roberts
π
Article
π
1997
π
Elsevier Science
π
English
β 722 KB
If D is an acyclic digraph, its competition graph is an undirected graph with the same vertex set and an edge between vertices x and y if there is a vertex a so that (x, a) and (y, a) are both arcs of D. If G is any graph, G together with sufficiently many isolated vertices is a competition graph, a