• Corpus ID: 238259550

Cyclic Base Ordering of Graphs

@inproceedings{Li2021CyclicBO,
  title={Cyclic Base Ordering of Graphs},
  author={Jessica Li and Eric Yang and William Zhang},
  year={2021}
}
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… 

References

SHOWING 1-3 OF 3 REFERENCES
Cyclic base orderings in some classes of graphs
A cyclic base ordering of a connected graph G is a cyclic ordering of E(G) such that every |V (G)−1| cyclically consecutive edges form a spanning tree ofG. LetG be a graph with E(G) ̸= ∅ and ω(G)
Graphs with uniform density
  • Congr . Numer .
  • 1988