The competition numbers of complete tripartite graphs

For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition numbers of complete tripartite graphs.

• Type: Journal
• Year: 2008
• Where: DAM
• Authors: Suh-Ryung Kim, Yoshio Sano
• Keywords: Competition Numbers, Complete Tripartite Graphs, DAM 2008, Hard Problem