APA (7th ed.) Citation

Froncek, D., & Kubesa, M. (2026). Decomposition of complete graphs into disconnected bipartite graphs with seven edges and eight vertices. Communications in Combinatorics & Optimization, 12(2), 661. https://doi.org/10.22049/cco.2024.29264.1915

Chicago Style (17th ed.) Citation

Froncek, Dalibor, and Michael Kubesa. "Decomposition of Complete Graphs into Disconnected Bipartite Graphs with Seven Edges and Eight Vertices." Communications in Combinatorics & Optimization 12, no. 2 (2026): 661. https://doi.org/10.22049/cco.2024.29264.1915.

MLA (9th ed.) Citation

Froncek, Dalibor, and Michael Kubesa. "Decomposition of Complete Graphs into Disconnected Bipartite Graphs with Seven Edges and Eight Vertices." Communications in Combinatorics & Optimization, vol. 12, no. 2, 2026, p. 661, https://doi.org/10.22049/cco.2024.29264.1915.