|
|||||
|
|
An algorithm for finding factorizations of complete graphs |
|
| Authors: | A J W Hilton Matthew Johnson |
| Abstract: | 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 prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003 |
| Keywords: | algorithms factorizations decompositions complete graphs |