Sciweavers

Share
DAM
2008

The competition numbers of complete tripartite graphs

8 years 7 months ago
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.
Suh-Ryung Kim, Yoshio Sano
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2008
Where DAM
Authors Suh-Ryung Kim, Yoshio Sano
Comments (0)
books