Updating the complexity status of coloring graphs without a fixed induced linear forest

The ellipsoid method and its consequences in combinatorial optimization

Martin Grötschel, László Lovász, Alexander Schrijver · COMBINATORICA · 1981 · 2K citations

Natural Sciences, Mathematics, Algorithms +8

The complexity of satisfiability problems

Thomas J. Schaefer · 1978 · 1.8K citations · Full text

Computing, Computer Science, Algorithms +12

A New Algorithm for Generating All the Maximal Independent Sets

Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi et al. · SIAM Journal on Computing · 1977 · 615 citations

Natural Sciences, Computer Science, Mathematics +13

Graph colorings with local constraints -- a survey

Źsolt Tuza · Discussiones Mathematicae Graph Theory · 1997 · 247 citations · Full text

Natural Sciences, Mathematics, Color Theory +8

Deciding k-Colorability of P 5-Free Graphs in Polynomial Time

Chı́nh T. Hoàng, Marcin Kamiński, Vadim Lozin et al. · Algorithmica · 2008 · 166 citations

Computing, Computer Science, Algorithms +12