Colouring vertices of triangle-free graphs without forests

The NP-Completeness of Edge-Coloring

Ian Holyer · SIAM Journal on Computing · 1981 · 1.1K citations

Upper bounds to the clique width of graphs

Bruno Courcelle, Stephan Olariu · Discrete Applied Mathematics · 2000 · 624 citations

Clique Width, Network Science, Graph Theory +8

A New Algorithm for Generating All the Maximal Independent Sets

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

Engineering, Combinatorial Design, Network Analysis +17

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 · 162 citations

Mathematical Programming, Engineering, Graph Theory +7

Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete

David P. Dailey · Discrete Mathematics · 1980 · 160 citations

Geometric Graph Theory, Graph Theory, Algebraic Graph Theory +6