Chuck Lundon
Chuck Lundon
Professor and Department Chair
Taylor Hall 210
I love teaching and talking about mathematics. At ÃÛѨÊÓƵ, I have turned this love into non-conventional study abroad experiences for students. I was fortunate to study abroad three times as an undergraduate (in USSR and UK) and graduate student (in China). I have taken these experiences and created new ones for my own students. I have traveled four times to Russia, Germany and Switzerland with students, following in the footsteps of Leonhard Euler, a prolific 18th-century mathematician. I have twice gone to China and Japan (with Dr. Christopher Keaveney) examining the ancient influences of Chinese mathematics on Japanese wasan and sangaku. And most recently, I ventured to Australia (with Dr. Michael Crosser) to study the astronomy and mathematics that lead to the Nobel-prize winning work Dr. Brian Schmidt, the Vice Chancellor for the Australian National University, and a friend of mine from high school in Anchorage, Alaska. I am hoping to offer this last course again with Dr. Crosser (and meeting again with Dr. Schmidt) in January 2023.
Education
- B.A., mathematics and music, Lewis & Clark College
- M.S., mathematics, University of Illinois at Urbana-Champaign
- Ph.D., mathematics, Arizona State University
Academic interests:
My research interests are in graph theory and combinatorics. In graph theory, my main focus has been in competitive graph coloring algorithms. I have worked with more than 30 student collaborators, both at ÃÛѨÊÓƵ, and as a part of an NSF-funded REU-RET (2008, 2009, 2012, 2013, 2014, 2017). These collaborations have resulted in a number of publications with student co-authors.
Publications:
- J. Caughman, C. Dunn, J. Laison, N. Neudauer, C. Starr, "Minimum representations of rectangle visibility graphs," in preparation.
- M. Alexis, C. Dunn, J. F. Nordstrom, D. Shurbert, "Clique-relaxed coloring games on chordal graphs," in preparation.
- C. Dunn, T. Hays, L. Naftz, J. F. Nordstrom, E. Samelson, J. Vega, "Total coloring games," in preparation.
- C. Dunn, V. Larsen, J.F. Nordstrom, "Introduction to Competitive Graph Coloring." In: Wootton A., Peterson V., Lee C. (eds) A Primer for Undergraduate Research. Foundations for Undergraduate Research in Mathematics. Birkhäuser, Cham. (2017).
- C. Dunn, D. Morawski, J. F. Nordstrom, "The relaxed edge-coloring game and k-degenerate graphs," Order 32, 347–361 (2015).
- C. Dunn, V. Larsen, K. Lindke, T. Retter, D. Toci, "The game chromatic number of trees and forests," Discrete Mathematics and Theoretical Computer Science, 17, No 2 (2015), 31-48.
- C. Dunn, "Complete multipartite graphs and the relaxed coloring game," Order, 29, Issues 3 (2012), 507-512.
- C. Dunn, C. Naymie, J. F. Nordstrom, E. Pitney, W. Sehorn, C. Suer, "Clique-relaxed graph coloring," Involve, 4 (2011), No.2, 127-138.
- J. Caughman, C. Dunn, N. Neudauer, C. Starr, "Counting lattice chains and Delannoy paths in higher dimensions," Discrete Mathematics, 311 (2011) 1803-1812.
- C. Dunn, "The relaxed game chromatic index of k-degenerate graphs," Discrete Mathematics, 307 (2007) 1767-1775.
- C. Dunn, H.A. Kierstead, "A simple competitive graph coloring algorithm III," Journal of Combinatorial Theory, Series B, 92 (2004) 137-150.
- C. Dunn, H.A. Kierstead, "The relaxed game chromatic number of outerplanar graphs," Journal of Graph Theory, 46 (2004) 69-78.
- C. Dunn, H.A. Kierstead, "A simple competitive graph coloring algorithm II," Journal of Combinatorial Theory, Series B, 90 (2004) 93-106.
- M. Crosser, C. Tillberg, C. Dunn, "Crisscrossing Science Episode 071: To Infinity and Beyond." crisscrossing Science. Audio File. Submission 71. (2019) https://digitalcommons.linfield.edu/crisscross/71
- M. Crosser, C. Tillberg, C. Dunn, "Crisscrossing Science Episode 110: Electile Dysfunction." crisscrossing Science. Audio File. Submission 110. (2020)
https://digitalcommons.linfield.edu/crisscross/110
Hobbies:
My interests are varied, but include working out, reading, traveling, music, and trying to keep up with my dog.
Favorite quote:
"Tend to where you are." (Barbara Sinclair, my 9th grade English teacher)