Charles Dunn
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Charles Dunn has a total of 12 co-authors. Here are the top co-authors by number of shared publications:
- Colin Starr
Department of Mathematics, Willamette University, Salem, USA
1 shared publication - David Morawski
University of Minnesota
1 shared publication Dustin Toci
1 shared publicationJ. F. Nordstrom
Linfield College
1 shared publication- Jennifer A. Firkins Nordstrom
Linfield University
1 shared publication - John S. Caughman
Department of Mathematics & Statistics Portland State University Portland OR USA
1 shared publication
Latest Publications
- 20 September 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (3) , 1-22
Area, perimeter, height, and width of rectangle visibility graphs
- 20 September 2023
- Published by Springer Nature in Journal of Combinatorial Optimization
- Vol. 46 (3) , 1-22
Area, perimeter, height, and width of rectangle visibility graphs
- 1 January 2017
- Published by Springer Nature
- p. 99-126
Introduction to Competitive Graph Coloring
- 13 November 2014
- Published by Springer Nature in Order
- Vol. 32 (3) , 347-361
The Relaxed Edge-Coloring Game and k-Degenerate Graphs
- 13 November 2014
- Published by Springer Nature in Order
- Vol. 32 (3) , 347-361
The Relaxed Edge-Coloring Game and k-Degenerate Graphs
- Open Access
The game chromatic number of trees and forests
While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree 3 and game chromatic number 4.
Open AccessThe game chromatic number of trees and forests
While the game chromatic number of a forest is known to be at most 4, no simple criteria are known for determining the game chromatic number of a forest. We first state necessary and sufficient conditions for forests with game chromatic number 2 and then investigate the differences between forests with game chromatic number 3 and 4. In doing so, we present a minimal example of a forest with game chromatic number 4, criteria for determining the game chromatic number of a forest without vertices of degree 3, and an example of a forest with maximum degree 3 and game chromatic number 4.
- 18 May 2011
- Published by Springer Nature in Order
- Vol. 29 (3) , 507-512
Complete Multipartite Graphs and the Relaxed Coloring Game
- 18 May 2011
- Published by Springer Nature in Order
- Vol. 29 (3) , 507-512
Complete Multipartite Graphs and the Relaxed Coloring Game