#### Filter Results:

#### Publication Year

2012

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

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)

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
- ›