An algorithm for finding factorizations of complete graphs

  • Authors:

  • A. J. W. Hilton;Matthew Johnson

  • Affiliations:

  • Department of Mathematics, University of Reading, Whiteknights, P.O. Box 220, Reading, RG6 6AX, United Kingdom;Department of Mathematics, University of Reading, Whiteknights, P.O. Box 220, Reading, RG6 6AX, United Kingdom

  • Venue:
  • Journal of Graph Theory
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

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