#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2010

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Mara Bovee, Kyle Burke, Craig Tennenhouse
- ArXiv
- 2016

In this paper, we consider combinatorial game rulesets based on data structures normally covered in an undergraduate Computer Science Data Structures course: arrays, stacks, queues, priority queues, sets, linked lists, and binary trees. We describe many rulesets as well as computational and mathematical properties about them. Two of the rulesets, Tower Nim… (More)

- Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse, Paul S. Wenger
- Journal of Graph Theory
- 2012

For a family F of graphs, a graph G is F-saturated if G contains no member of F as a subgraph, but for any edge uv in G, G + uv contains some member of F as a subgraph. The minimum number of edges in an F-saturated graph of order n is denoted sat(n, F). A subdivision of a graph H, or an H-subdivision, is a graph G obtained from H by replacing the edges of H… (More)

- Craig M. Tennenhouse, Michael S. Jacobson, Richard Lundgren, Michael Ferrara, Ellen Gethner, Jason Williford
- 2010

Extremal Graph Theory is the particular subfield of Graph Theory concerned with maximizing and minimizing certain parameters associated with graphs and digraphs. Beginning with Mantel [46] and Ramsey [52], the study of extremal graphs was extended by Turán [56] into edge-maximum clique free graphs. Similar problems, particularly those in this thesis, are… (More)

- ‹
- 1
- ›