On the complexity of the independent set problem in triangle graphs

Graph Theory with Applications

E. Kay, J. A. Bondy, U. S. R. Murty · Operational Research Quarterly (1970-1977) · 1977 · 3K citations

Computing, Computer Science, Mathematics +12

Clique is hard to approximate within n1−ε

Johan Håstad · Acta Mathematica · 1999 · 1.4K citations · Full text

Computing, Computer Science, Algorithms +3

Complexity and approximation: Combinatorial optimization problems and their approximability properties

Computers & Mathematics with Applications · 2000 · 1.3K citations

Computing, Computer Science, Mathematics +13

Complement reducible graphs

Derek G. Corneil, H. Lerchs, L.Stewart Burlingham · Discrete Applied Mathematics · 1981 · 837 citations

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

Fǎnicǎ Gavril · SIAM Journal on Computing · 1972 · 536 citations

Natural Sciences, Computer Science, Mathematics +11