论文信息 - Computing independent sets in graphs with large girth - 字舞流文

Computing independent sets in graphs with large girth

Owen J. Murphy | O. Murphy

[1] P. Erdös,et al. Graph Theory and Probability , 1959 .

[2] David S. Johnson,et al. Some Simplified NP-Complete Graph Problems , 1976, Theor. Comput. Sci..

[3] S. Poljak. A note on stable sets and colorings of graphs , 1974 .

[4] W. Staton. Some Ramsey-type numbers and the independence ratio , 1979 .

[5] Jerrold R. Griggs. Lower bounds on the independence number in terms of the degrees , 1983, J. Comb. Theory, Ser. B.

[6] Owen Murphy,et al. Lower bounds on the stability number of graphs computed in terms of degrees , 1991, Discret. Math..

[7] G. Hopkins,et al. Girth and Independence Ratio , 1982, Canadian Mathematical Bulletin.

[8] Leslie E. Trotter,et al. Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[9] Kenneth P. Bogart,et al. Introductory Combinatorics , 1977 .

[10] R. Brualdi. Introductory Combinatorics , 1992 .