Rate My Professor Chuck Lundon

Lundon's research interests are in graph theory and combinatorics, with a main focus on competitive graph coloring algorithms. He has worked with more than 30 student collaborators on research projects funded by NSF REU-RET programs in 2008, 2009, 2012, 2013, 2014, and 2017, resulting in numerous publications. Key publications include "Area, perimeter, height, and width of rectangle visibility graphs" in Journal of Combinatorial Optimization (2022), "The game chromatic number of trees and forests" in Discrete Mathematics and Theoretical Computer Science (2015), "The relaxed edge-coloring game and k-degenerate graphs" in Order (2015), "Introduction to Competitive Graph Coloring" in A Primer for Undergraduate Research (2017), "A simple competitive graph coloring algorithm III" in Journal of Combinatorial Theory, Series B (2004), and "The relaxed game chromatic index of k-degenerate graphs" in Discrete Mathematics (2007). He has led January-Term study abroad courses four times to Russia, Germany, and Switzerland following Leonhard Euler's footsteps; twice to China and Japan examining ancient Chinese mathematics' influences on Japanese wasan and sangaku; and twice to Australia studying astronomy and mathematics related to Brian Schmidt's Nobel Prize work. Lundon is also a Jeopardy! winner.