Area, perimeter, height, and width of rectangle visibility graphs. - Caughman, John S., IV; Dunn, Charles L.; Laison, Joshua D.; Neudauer, Nancy Ann; Starr, Colin L. (J. Comb. Optim., 2023)

The game chromatic number of trees and forests. - Dunn, Charles L.; Larsen, Victor; Lindke, Kira; Retter, Troy; Toci, Dustin (Discret. Math. Theor. Comput. Sci., 2015)

The Relaxed Edge-Coloring Game and k-Degenerate Graphs. - Dunn, Charles L.; Morawski, David; Nordstrom, Jennifer (Order, 2015)

Clique-Relaxed Competitive Graph Coloring. - Alexis, Michel; Shurbert, Davis; Dunn, Charles L.; Nordstrom, Jennifer (CoRR, 2014)

Complete Multipartite Graphs and the Relaxed Coloring Game. - Dunn, Charles L. (Order, 2012)

Counting lattice chains and Delannoy paths in higher dimensions. - Caughman, John S., IV; Dunn, Charles L.; Neudauer, Nancy Ann; Starr, Colin L. (Discret. Math., 2011)

The relaxed game chromatic index of k-degenerate graphs. - Dunn, Charles L. (Discret. Math., 2007)

A simple competitive graph coloring algorithm II. - Dunn, Charles L.; Kierstead, Hal A. (J. Comb. Theory B, 2004)

A simple competitive graph coloring algorithm III. - Dunn, Charles L.; Kierstead, Hal A. (J. Comb. Theory B, 2004)

The relaxed game chromatic number of outerplanar graphs. - Dunn, Charles L.; Kierstead, Hal A. (J. Graph Theory, 2004)