Skip to Main Content Skip to Footer Toggle Navigation Menu
Rain in the morning sunrise in the Quad

Faculty Detail

Back to Department Pages
Charles Dunn Professor

Charles Dunn

Professor

Education:

Ph.D., Mathematics, Arizona State University; M.S., Mathematics, University of Illinois at Urbana-Champaign; B.A., Mathematics & Music, Lewis & Clark College



Taylor 210

503-883-2273

cdunn@linfield.edu

Publications:

  • C. Dunn, D. Morawski, J. F. Nordstrom, "The relaxed edge-coloring game and k-degenerate graphs," Order, to appear.
  • 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.

Hobbies

Dr. Dunn is a trombone player.  He regularly performs with the Rose City Trombones.  He is also an avid runner.  

Favorite Quote

"Tend to where you are." (Barbara Sinclair, my 9th grade English teacher)