#### Filter Results:

#### Publication Year

2004

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Charles Dunn, Hal A. Kierstead
- J. Comb. Theory, Ser. B
- 2004

- Charles Dunn, Hal A. Kierstead
- Journal of Graph Theory
- 2004

- Charles Dunn, Hal A. Kierstead
- J. Comb. Theory, Ser. B
- 2004

- Thomas Dean, Charles Dunn
- 2012

—We propose a new 3D barcode standard, Quick Layered Response (QLR) codes, and implemented encoding and decoding on Android devices. QLR codes are Quick Response (QR) codes superimposed in the RGB color space, and increase the capacity by a factor of 3. This advantage can be used to decrease the area needed to represent data by a factor of 3 or to increase… (More)

- Charles Dunn, Jennifer Firkins Nordstrom, Cassandra Naymie, Erin Pitney, William Sehorn, Charlie Suer
- 2012

We define a generalization of the chromatic number of a graph G called the k-clique-relaxed chromatic number, denoted χ (k) (G). We prove bounds on χ (k) (G) for all graphs G, including corollaries for outerplanar and planar graphs. We also define the k-clique-relaxed game chromatic number, χ (k) g (G), of a graph G. We prove χ (2) g (G) ≤ 4 for all… (More)

- Charles Dunn
- Discrete Mathematics
- 2007

The (r, d)-relaxed coloring game is a two-player game played on the vertex set of a graph G. We consider a natural analogue to this game on the edge set of G called the (r, d)-relaxed edge-coloring game. We consider this game on trees and more generally, on k-degenerate graphs. We show that if G is k-degenerate with ∆(G) = ∆, then the first player, Alice,… (More)

- Charles Dunn, David Morawski, Jennifer Nordstrom
- Order
- 2015

- Michel Alexis, Davis Shurbert, Charles Dunn, Jennifer Nordstrom
- ArXiv
- 2014

We investigate a variation of the graph coloring game, as studied in [2]. In the original coloring game, two players, Alice and Bob, alternate coloring vertices on a graph with legal colors from a fixed color set, where a color {\alpha} is legal for a vertex if said vertex has no neighbors colored {\alpha}. Other variations of the game change this… (More)

- Charles Dunn
- Order
- 2012

Let k be a positive integer, d be a nonnegative integer, and G be a finite graph. Two players, Alice and Bob, play a game on G by coloring the uncolored vertices with colors from a set X of k colors. At all times, the subgraph induced by a color class must have maximum degree at most d. Alice wins the game if all vertices are eventually colored; otherwise,… (More)

- ‹
- 1
- ›