Date of Submission
Academic Programs and Concentrations
Project Advisor 1
A lattice graph is a graph whose drawing, embedded in Euclidean space R2, has vertices that are the points with integer coecients, and has edges that are unit length and are parallel to the coordinate axes. A 4-regular graph is a graph where each vertex has four edges containing it; a loop containing a vertex counts as two edges. The goal for my senior project is to find upper bounds for the number of lattice edges needed to represent 4-regular graphs as lattice graphs.
Open Access Agreement
Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 4.0 License.
Li, Shenze, "Upper Bounds for the Number of Lattice Edges Needed to Represent 4-Regular Graphs as Lattice Graphs" (2019). Senior Projects Spring 2019. 238.