An algorithm for finding factorizations of complete graphs
From MaRDI portal
Publication:4406068
DOI10.1002/jgt.10109zbMath1015.05075WikidataQ114236193 ScholiaQ114236193MaRDI QIDQ4406068
Matthew Johnson, Anthony J. W. Hilton
Publication date: 25 June 2003
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.10109
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Amalgamations of factorizations of complete graphs, A Lagrangian approach for minimum cost single round robin tournaments, Amalgamations of factorizations of complete equipartite graphs, Enclosings of decompositions of complete multigraphs in 2-edge-connected \(r\)-factorizations