Daniel P. Sanders is an American mathematician. He is known for his 1996 efficient proof (algorithm) of proving the Four color theorem. He was a guest professor of the department of computer science at Columbia University.
Select work
• On linear recognition of tree-width at most four, DP Sanders - SIAM Journal on Discrete Mathematics, 1996 - link.aip.org • Efficiently four-coloring planar graphs, - gatech.edu [PS], N Robertson, DP Sanders, P Seymour, R Thomas - Proceedings of the twenty-eighth annual ACM symposium on …, 1996 - portal.acm.org ==References==