Title of article
Cubic factorizations
Author/Authors
Rosenfeld، نويسنده , , Moshe and H?a، نويسنده , , V? ??nh، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2013
Pages
9
From page
1952
To page
1960
Abstract
We use 1-factorizations of K 6 n + 4 and a labeling scheme to prove that certain infinite sequences of cubic graphs factorize the complete graphs K 6 n + 4 . We conclude with a new constrained Round-Robin scheduling problem that was used in some of our constructions.
Keywords
Graph labeling 05C78 , Graph representation 05C62 , Edge coloring 05C15 , Factorization 05C70
Journal title
Discrete Mathematics
Serial Year
2013
Journal title
Discrete Mathematics
Record number
1600417
Link To Document