A note on the Greedy algorithm for finding independent sets of -free graphs
References (17)
- et al.
A note on Ramsey numbers
J. Combin. Theory Ser. A
(1980) Lower bounds on the independence number in terms of the degrees
J. Combin. Theory Ser. B
(1983)A note on the independence number of triangle-free graphs
Discrete Math.
(1983)- et al.
- et al.
On maximal paths and circuits of graphs
Acta Math. Acad. Sci. Hung.
(1959) On the graph theorem of Turán
Mat. Lapok
(1970)The independence ratio for cubic graphs
On the size of independent sets in graphs
There are more references available in the full text version of this article.
Cited by (0)
Copyright © 2009 Elsevier B.V. All rights reserved.