Cyclic Base Ordering of Graphs

MaRDI QIDQ6379232zbMATH OpenFDO

Authors Jessica C. Li, Eric Yang, William W. Zhang

Publication date 2 October 2021

Abstract: 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.

This page was built for publication: Cyclic Base Ordering of Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6379232)