Decomposition of complete graphs into disconnected unicyclic bipartite graphs with seven edges and more than eight vertices
Abstract
In this paper, we continue investigation of decompositions of complete graphs into graphs with seven edges. The spectrum has been completely determined for such graphs with at most six vertices. The spectrum for bipartite graphs is completely known for graphs with seven or eight vertices. In this paper we completely solve the case of disconnected unicyclic bipartite graphs with seven edges by studying the remaining graphs with nine or ten vertices.
Fields of Study & Subjects
Advanced Graph Theory Research
Advanced Combinatorial Mathematics
Graph theory and applications
Publication details
- Journal / source
- Journal of Combinatorial Mathematics and Combinatorial Computing
- Volume
- 129
- Pages
- 79–94
- Publication date
- 26 January 2026