APA (7th ed.) Citation

Banegas, D., Carlson, A., & Froncek, D. (2026). Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices. Journal of Combinatorial Mathematics & Combinatorial Computing, 129, 79. https://doi.org/10.61091/jcmcc129-07

Chicago Style (17th ed.) Citation

Banegas, D., A. Carlson, and D. Froncek. "Decomposition of Complete Graphs into Disconnected Unicyclic Bipartite Graphs with Seven Edges and More than Eight Vertices." Journal of Combinatorial Mathematics & Combinatorial Computing 129 (2026): 79. https://doi.org/10.61091/jcmcc129-07.

MLA (9th ed.) Citation

Banegas, D., et al. "Decomposition of Complete Graphs into Disconnected Unicyclic Bipartite Graphs with Seven Edges and More than Eight Vertices." Journal of Combinatorial Mathematics & Combinatorial Computing, vol. 129, 2026, p. 79, https://doi.org/10.61091/jcmcc129-07.