Packing cycles in complete graphs

被引：21
|
作者：
Bryant, Darryn [1 ]
Horsley, Daniel [1 ]
机构：
[1] Univ Queensland, Dept Math, Brisbane, Qld 4072, Australia
来源：
JOURNAL OF COMBINATORIAL THEORY SERIES B | 2008年 / 98卷 / 05期
基金：
澳大利亚研究理事会;
关键词：
cycle decompositions; graph decompositions; graph packing;
D O I：
10.1016/j.jctb.2007.12.004
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We introduce a new technique for packing pairwise edge-disjoint cycles of specified lengths in complete graphs and use it to prove several results. Firstly, we prove the existence of dense packings of the complete graph with pairwise edge-disjoint cycles of arbitrary specified lengths. We then use this result to prove the existence of decompositions of the complete graph of odd order into pairwise edge-disjoint cycles for a large family of lists of specified cycle lengths. Finally, we construct new maximum packings of the complete graph with pairwise edge-disjoint cycles of uniform length. (C) 2008 Elsevier Inc. All rights reserved.
引用
收藏
页码：1014 / 1037
页数：24
相关论文
共 50 条
  • [1] Packing complete multipartite graphs with 4-cycles
    Billington, EJ
    Fu, HL
    Rodger, CA
    JOURNAL OF COMBINATORIAL DESIGNS, 2001, 9 (02) : 107 - 127
  • [2] Packing λ-fold complete multipartite graphs with 4-cycles
    Billington, EJ
    Fu, HL
    Rodger, CA
    GRAPHS AND COMBINATORICS, 2005, 21 (02) : 169 - 185
  • [3] Packing λ-Fold Complete Multipartite Graphs with 4-Cycles
    Elizabeth J. Billington
    Hung-Lin Fu
    C. A. Rodger
    Graphs and Combinatorics, 2005, 21 : 169 - 186
  • [4] Packing cycles in graphs
    Ding, GL
    Zang, WN
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2002, 86 (02) : 381 - 407
  • [5] Packing 1-Plane Hamiltonian Cycles in Complete Geometric Graphs
    Trao, Hazim Michman
    Ali, Niran Abbas
    Chia, Gek L.
    Kilicman, Adem
    FILOMAT, 2019, 33 (06) : 1561 - 1574
  • [6] Packing cycles in undirected graphs
    Caprara, A
    Panconesi, A
    Rizzi, R
    JOURNAL OF ALGORITHMS, 2003, 48 (01) : 239 - 256
  • [7] Packing cycles in graphs, II
    Ding, GL
    Xu, ZZ
    Zang, WN
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 87 (02) : 244 - 253
  • [8] On packing shortest cycles in graphs
    Rautenbach, Dieter
    Regen, Friedrich
    INFORMATION PROCESSING LETTERS, 2009, 109 (14) : 816 - 821
  • [9] Packing paths in complete graphs
    Bryant, Darryn
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2010, 100 (02) : 206 - 215
  • [10] PACKING TREES IN COMPLETE GRAPHS
    HOBBS, AM
    BOURGEOIS, BA
    KASIRAJ, J
    DISCRETE MATHEMATICS, 1987, 67 (01) : 27 - 42
12345