Premium
r‐Regular, r‐connected decompositions of complete graphs
Author(s) -
Fleischner H.,
Johnstone W. R.,
Hilton A. J. W.
Publication year - 2000
Publication title -
journal of combinatorial designs
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.618
H-Index - 34
eISSN - 1520-6610
pISSN - 1063-8539
DOI - 10.1002/(sici)1520-6610(2000)8:1<15::aid-jcd3>3.0.co;2-u
Subject(s) - mathematics , combinatorics , disjoint sets , strongly regular graph , disjoint union (topology) , enhanced data rates for gsm evolution , discrete mathematics , graph , pathwidth , line graph , computer science , artificial intelligence
If r |( n ‐1) and rn is even, then K n can be expressed as the union of $t={n-1\over r}$ edge‐disjoint isomorphic r ‐regular r ‐connected factors. © 2000 John Wiley & Sons, Inc. J Combin Designs 8: 15–21, 2000