Author:
Rota Bulò Samuel,Pelillo Marcello
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Hastad, J.: Clique is hard to approximate within n
1 − ε
. Ann. Symp. Found. Comput. Sci. 37, 627–636 (1996)
2. Lovás, L.: On the Shannon capacity of a graph. IEEE Trans. Inform. Theory IT-25, 1–7 (1979)
3. Schrijver, A.: A comparison of the Delsarte and Lovász bounds. IEEE Trans. Inform. Theory 25, 425–429 (1979)
4. Wilf, H.S.: The eigenvalues of a graph and its chromatic number. J. London Math. Soc. 42, 330–332 (1967)
5. Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of Turán. Canad. J. Math. 17, 533–540 (1965)
Cited by
37 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献