Outputs (72)

An algorithm for finding factorizations of complete graphs, (2003)
Journal Article
Hilton, A., & Johnson, M. (2003). An algorithm for finding factorizations of complete graphs,. Journal of Graph Theory, 43, 132-136. https://doi.org/10.1002/jgt.10109

We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge-connectivity of each factor is given.

Amalgamations of connected k-factorizations (2003)
Journal Article
Hilton, A., Johnson, M., Rodger, C., & Wantland, E. (2003). Amalgamations of connected k-factorizations. Journal of Combinatorial Theory, Series B, 88(2), 267-279. https://doi.org/10.1016/s0095-8956%2803%2900030-3

In this paper, necessary and sufficient conditions are found for a graph with exactly one amalgamated vertex to be the amalgamation of a k-factorization of K_kn+1 in which each k-factor is connected. From this result, necessary and sufficie... Read More about Amalgamations of connected k-factorizations.