Charles L. Dunn

Orcid: 0000-0002-0526-9012

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Area, perimeter, height, and width of rectangle visibility graphs.
J. Comb. Optim., September, 2023

2015
The Relaxed Edge-Coloring Game and k-Degenerate Graphs.
Order, 2015

The game chromatic number of trees and forests.
Discret. Math. Theor. Comput. Sci., 2015

2014
Clique-Relaxed Competitive Graph Coloring.
CoRR, 2014

2012
Complete Multipartite Graphs and the Relaxed Coloring Game.
Order, 2012

2011
Counting lattice chains and Delannoy paths in higher dimensions.
Discret. Math., 2011

2007
The relaxed game chromatic index of k-degenerate graphs.
Discret. Math., 2007

2004
The relaxed game chromatic number of outerplanar graphs.
J. Graph Theory, 2004

A simple competitive graph coloring algorithm II.
J. Comb. Theory B, 2004

A simple competitive graph coloring algorithm III.
J. Comb. Theory B, 2004


  Loading...