  Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a
cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges
induce a spanning tree of $G$. In this project, we study cyclic base ordering
of triangular grid graphs, series composition of graphs, generalized theta
graphs, and circulant graphs.
