#### Filter Results:

- Full text PDF available (3)

#### Publication Year

2012

2016

- This year (0)
- Last 5 years (3)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### 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)

- Craig Tennenhouse
- Australasian J. Combinatorics
- 2015

A set S of vertices in a graph G is a resolving set if for every pair of vertices u, v ∈ V (G) there is a vertex x ∈ S such that the distances d(x, v) 6= d(x, u). We define a new parameter res(G), the size of the smallest subset S of V (G) that is not a resolving set but every superset of S resolves G. We also demonstrate that for every triple (a, b, c), a… (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)

- ‹
- 1
- ›