Almost Regular Edge Colorings and Regular Decompositions of Complete Graphs

被引：4

作者：

Bryant, Darryn ^{[1
]}

Maenhaut, Barbara ^{[1
]}

机构：

[1] Univ Queensland, Dept Math, Brisbane, Qld 4072, Australia

来源：

JOURNAL OF COMBINATORIAL DESIGNS | 2008年 / 16卷 / 06期

基金：

澳大利亚研究理事会;

关键词：

graph; decomposition; graph factorization; graph packing;

D O I：

10.1002/jcd.20190

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

For k = 1 and k = 2, we prove that the obvious necessary numerical conditions for packing t pairwise edge-disjoint k-regular subgraphs of specified orders m(1), m(2),..., m(t) in the complete graph of order n are also sufficient. To do so, we present an edge-coloring technique which also yields new proofs of various known results on graph factorizations. For example, a new construction for Hamilton cycle decompositions of complete graphs is given. (C) 2008 Wiley Periodicals, Inc. J Combin Designs 16: 499-506, 2008

引用

页码：499 / 506

页数：8

共 13 条

[1]

Alspach B, 1981, DISCRETE MATH, V36, P333, DOI DOI 10.1016/S0012-365X(81)80029-5

[2]

Andersen L. D., 2003, LONDON MATH SOC LECT, V307, P7

[3] Packing circuits into KN [J].