Journal article
Maximal Sets of 2-Factors and Hamiltonian Cycles
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}.
Authors
Hoffman DG; Rodger CA; Rosa A
Journal
Journal of Combinatorial Theory Series B, Vol. 57, No. 1, pp. 69–76
Publisher
Elsevier
Publication Date
January 1993
DOI
10.1006/jctb.1993.1006
ISSN
0095-8956