#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2004

2017

- This year (1)
- Last 5 years (4)
- Last 10 years (6)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger
- J. Comb. Theory, Ser. B
- 2012

We exhibit an explicit list of nine graphs such that a graph drawn in the Klein bottle is 5-colorable if and only if it has no subgraph isomorphic to a member of the list. 31 August 2007, revised 18 January 2012. Partially supported by NSF under Grant No. DMS-0200595. Partially supported by NSF under Grants No. DMS-0200595, DMS-0354742, and DMS-0701077.… (More)

- Daniel Irving Bernstein, David J. Grynkiewicz, Carl Yerger
- Discrete Mathematics
- 2015

Let [a, b] denote the integers between a and b inclusive and, for a finite subset X ⊆ Z, let diam (X) = max(X) − min(X). We write X <p Y provided max(X) < min(Y ). For a positive integer m, let f(m,m,m; 2) be the least integer N such that any 2-coloring ∆ : [1, N ] → {0, 1} has three monochromatic m-sets B1, B2, B3 ⊆ [1, N ] (not necessarily of the same… (More)

In the summer of 2004, I participated in an REU program at East Tennessee State University. Many of the investigations I worked on were successful, leading to 4-6 papers, some of which have been submitted, and others are still in the writing process. There are many unanswered questions left in the investigations that I was conducting, and some of the work… (More)

- Daniel W. Cranston, Luke Postle, Chenxiao Xue, Carl Yerger
- J. Comb. Optim.
- 2017

- Nathan Chenette, Luke Postle, +6 authors Bernard Lidický
- Electronic Notes in Discrete Mathematics
- 2008

- Chenxiao Xue, Carl Yerger
- Graphs and Combinatorics
- 2016

- Luke Postle, Noah Streib, Carl Yerger
- Journal of Graph Theory
- 2009

Given a configuration of pebbles on the vertices of a connected graph G, a pebbling move is defined as the removal of two pebbles from some vertex and the placement of one of these on an adjacent vertex. The pebbling number of a graph G is the smallest integer k such that for each vertex v and each configuration of k pebbles on G there is a sequence of… (More)

- ‹
- 1
- ›