Skip to Main Content Skip to Footer
Home
The top of Pioneer Hall through vibrant fall leaves on the trees.

Chuck Lundon

Chuck Lundon Professor and Department Chair


Taylor Hall 210

503-883-2273

chuckl@linfield.edu

I have always loved doing mathematics and talking about mathematics. At Linfield, I have tried to turn my enthusiasm and my experiences into as many opportunities for our students as possible, whether within or outside the classroom. I was fortunate, for example, to study abroad two semesters as an undergraduate (in the Soviet Union and in the United Kingdom), and for six months as a Visiting Foreign Student at the Chinese Academy of Sciences in Beijing.

For students at Linfield, I have turned these experiences into January-Term off-campus courses: four times to Russia, Germany and Switzerland following in the footsteps of Leonhard Euler, a prolific 18th-century mathematician; twice to China and Japan (with Dr. Christopher Keaveney) examining the influences of ancient Chinese mathematics on Japanese wasan and sangaku; and twice to Australia (with Dr. Michael Crosser) to study the astronomy and mathematics leading to the 2011 Nobel-prize winning work of Dr. Brian Schmidt, the Vice Chancellor for the Australian National University, and a friend of mine from high school in Anchorage, Alaska. Dr. Crosser and I are hoping to lead this course again in January 2028.

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 Linfield, 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 Lundon, J. Laison, N. Neudauer, C. Starr. “Triangle visibility graphs.” in preparation.
  • M. Alexis, C. Lundon, J. F. Nordstrom, D. Shurbert, "Clique-relaxed coloring games on chordal graphs," in preparation.
  • J. Caughman, C. Lundon, J. Laison, N. Neudauer, C. Starr. “Area, perimeter, height, and width of rectangle visibility graphs.” Journal of Combinatorial Optimization 46 (2022): 1-22.
  • M. Crosser, C. Tillberg, C. Lundon 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. Lundon Dunn, "Crisscrossing Science Episode 110: Electile Dysfunction." crisscrossing Science. Audio File. Submission 110. (2020): https://digitalcommons.linfield.edu/crisscross/110.
  • C. Lundon 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. Lundon Dunn, D. Morawski, J.F. Nordstrom, "The relaxed edge-coloring game and k-degenerate graphs," Order 32, (2015): 347–361.
  • C. Lundon 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. Lundon Dunn, "Complete multipartite graphs and the relaxed coloring game," Order, 29, Issues 3 (2012), 507-512.
  • C. Lundon Dunn, C. Naymie, J. F. Nordstrom, E. Pitney, W. Sehorn, C. Suer, "Clique-relaxed graph coloring," Involve, 4, No.2, (2011): 127-138.
  • J. Caughman, C. Lundon Dunn, N. Neudauer, C. Starr, "Counting lattice chains and Delannoy paths in higher dimensions," Discrete Mathematics, 311 (2011): 1803-1812.
  • C. Lundon Dunn, "The relaxed game chromatic index of k-degenerate graphs," Discrete Mathematics, 307 (2007): 1767-1775.
  • C. Lundon Dunn, H.A. Kierstead, "A simple competitive graph coloring algorithm III," Journal of Combinatorial Theory, Series B, 92 (2004): 137-150.
  • C. Lundon Dunn, H.A. Kierstead, "The relaxed game chromatic number of outerplanar graphs," Journal of Graph Theory, 46 (2004): 69-78.
  • C. Lundon Dunn, H.A. Kierstead, "A simple competitive graph coloring algorithm II," Journal of Combinatorial Theory, Series B, 90 (2004): 93-106.

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)