A linear 5-coloring algorithm of planar graphs

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

Computing, Computer Science, Mathematics +11

An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs

Norishige Chiba, Takao Nishizeki, Nobuji Saito · SIAM Journal on Computing · 1982 · 31 citations

Computing, Computer Science, Mathematics +16

A batching method for coloring planar graphs

Richard J. Lipton, Raymond E. Miller · Information Processing Letters · 1978 · 21 citations

Computing, Computer Science, Computational Geometry +11