The competition number of a graph with exactly two holes
暂无分享,去创建一个
[1] J. Richard Lundgren,et al. Food Webs, Competition Graphs, Competition-Common Enemy Graphs, and Niche Graphs , 1989 .
[2] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[3] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[4] Jung Yeun Lee,et al. The competition number of a graph whose holes do not overlap much , 2010, Discret. Appl. Math..
[5] Fred S. Roberts,et al. Competition Numbers of Graphs with a Small Number of Triangles , 1997, Discret. Appl. Math..
[6] Han Hyuk Cho,et al. The competition number of a graph having exactly one hole , 2005, Discret. Math..
[7] Suh-Ryung Kim,et al. The Competition Number and its Variants , 1993 .
[8] Fred S. Roberts,et al. Food webs, competition graphs, and the boxicity of ecological phase space , 1978 .
[9] Suh-Ryung Kim. Graphs with one hole and competition number one , 2005 .
[10] F. Roberts. Graph Theory and Its Applications to Problems of Society , 1987 .
[11] Robert J. Opsut. On the Computation of the Competition Number of a Graph , 1982 .
[12] Gerard J. Chang,et al. The competition number of a graph with exactly h holes, all of which are independent , 2009, Discret. Appl. Math..