Complexity of list coloring problems with a fixed total number of colors

Complement reducible graphs

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

Normal hypergraphs and the perfect graph conjecture

László Lovász · Discrete Mathematics · 1972 · 762 citations

Natural Sciences, Computer Science, Mathematics +9

On a property of the class of n-colorable graphs

D Seinsche · Journal of Combinatorial Theory Series B · 1974 · 306 citations

Natural Sciences, Mathematics, Combinatorics +9

Linear-time modular decomposition and efficient transitive orientation of comparability graphs

Ross M. McConnell, Jeremy Spinrad · Symposium on Discrete Algorithms · 1994 · 181 citations

Computing, Computer Science, Algorithms +10

Precoloring extension. I. Interval graphs

Miklós Bíró, Mihály Hujter, Zs. Tuza · Discrete Mathematics · 1992 · 158 citations

Natural Sciences, Visualization, Color Theory +5