Premium
An algorithm for finding factorizations of complete graphs
Author(s) -
Hilton A. J. W.,
Johnson Matthew
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10109
Subject(s) - combinatorics , mathematics , degree (music) , graph , discrete mathematics , enhanced data rates for gsm evolution , set (abstract data type) , algorithm , computer science , artificial intelligence , physics , acoustics , programming language
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
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom