Title of article
Maximal Sets of 2-Factors and Hamiltonian Cycles
Author/Authors
Hoffman، نويسنده , , D.G. and Rodger، نويسنده , , C.A. and Rosa، نويسنده , , A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1993
Pages
8
From page
69
To page
76
Abstract
In this paper we find, for each integer d, the smallest d-regular graphs which contain no d′-regular subgraphs, 0 > d′ > d. We then find the set of integers Sp2(n) = {m: there exists a maximal set of m edge-disjoint 2-factors of Kn}, as well as SpH2(n) = {m: there exists a maximal set of m edge-disjoint Hamiltonian cycles of Kn}.
Journal title
Journal of Combinatorial Theory Series B
Serial Year
1993
Journal title
Journal of Combinatorial Theory Series B
Record number
1525700
Link To Document