Charles L. Dunn

According to our database, Charles L. Dunn authored at least 10 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Area, perimeter, height, and width of rectangle visibility graphs.

John S. Caughman IV, Charles L. Dunn, Joshua D. Laison, Nancy Ann Neudauer, Colin L. Starr

J. Comb. Optim., September, 2023

2015

The Relaxed Edge-Coloring Game and k-Degenerate Graphs.

Charles L. Dunn, David Morawski, Jennifer Nordstrom

Order, 2015

The game chromatic number of trees and forests.

Charles L. Dunn, Victor Larsen, Kira Lindke, Troy Retter, Dustin Toci

Discret. Math. Theor. Comput. Sci., 2015

2014

Clique-Relaxed Competitive Graph Coloring.

Michel Alexis, Davis Shurbert, Charles L. Dunn, Jennifer Nordstrom

CoRR, 2014

2012

Complete Multipartite Graphs and the Relaxed Coloring Game.

Charles L. Dunn

Order, 2012

2011

Counting lattice chains and Delannoy paths in higher dimensions.

John S. Caughman IV, Charles L. Dunn, Nancy Ann Neudauer, Colin L. Starr

Discret. Math., 2011

2007

The relaxed game chromatic index of k-degenerate graphs.

Charles L. Dunn

Discret. Math., 2007

2004

The relaxed game chromatic number of outerplanar graphs.

Charles L. Dunn, Hal A. Kierstead

J. Graph Theory, 2004

A simple competitive graph coloring algorithm II.

Charles L. Dunn, Hal A. Kierstead

J. Comb. Theory, Ser. B, 2004

A simple competitive graph coloring algorithm III.

Charles L. Dunn, Hal A. Kierstead

J. Comb. Theory, Ser. B, 2004