MAXIMAL SETS OF 2-FACTORS AND HAMILTONIAN CYCLES

被引：18

作者：

HOFFMAN, DG ^{[1
]}

RODGER, CA ^{[1
]}

ROSA, A ^{[1
]}

机构：

[1] MCMASTER UNIV,DEPT MATH,HAMILTON L8S 4K1,ONTARIO,CANADA

来源：

JOURNAL OF COMBINATORIAL THEORY SERIES B | 1993年 / 57卷 / 01期

关键词：

D O I：

10.1006/jctb.1993.1006

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

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}. © 1993 Academic Press. All rights reserved.

引用

页码：69 / 76

页数：8