  A cyclic base ordering of a connected graph $G$, is a cyclic ordering of
$E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning
tree. In this project, we study cyclic base ordering of various families of
graphs, including square of cycles, wheel graphs, generalized wheel graphs and
broken wheel graphs, fan and broken fan graphs, prism graphs, and maximal
2-degenerate graphs. We also provide a polynomial time algorithm to verify any
giving edge ordering is a cyclic base ordering.
