The complexity of generalized clique covering

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

Triangulated graphs and the elimination process

Donald J. Rose · Journal of Mathematical Analysis and Applications · 1970 · 510 citations

Computing, Computer Science, Mathematics +9

Decomposition by clique separators

Robert E. Tarjan · Discrete Mathematics · 1985 · 439 citations

Natural Sciences, Mathematics, Combinatorics +4

Edge-Deletion Problems

Mihalis Yannakakis · SIAM Journal on Computing · 1981 · 207 citations

Natural Sciences, Computer Science, Mathematics +7

The maximum k-colorable subgraph problem for chordal graphs

Mihalis Yannakakis, Fǎnicǎ Gavril · Information Processing Letters · 1987 · 157 citations

Natural Sciences, Mathematics, Combinatorics +8