Davis Shurbert

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
This paper aims to give a focused introduction to algebraic graph theory accessible to mathematically mature undergraduates. We will begin by giving some standard definitions, then expanding our focus to specifically study properties of graph homomorphisms in the context of constraint satisfaction problems (graph coloring in disguise). In particular, we(More)
  • 1