2 search results - page 1 / 1 » The competition numbers of complete tripartite graphs |
DAM
2008
13 years 4 months ago
2008
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 nu...
COR
2010
13 years 4 months ago
2010
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of...