Almost Resolvable Maximum Packings of Complete Graphs with 4-Cycles

被引:0
|
作者
Elizabeth J. Billington
Italo J. Dejter
D. G. Hoffman
C. C. Lindner
机构
[1] The University of Queensland,Department of Mathematics
[2] University of Puerto Rico,Department of Mathematics and Computer Science
[3] Auburn University,Department of Mathematics and Statistics
来源
Graphs and Combinatorics | 2011年 / 27卷
关键词
4-Cycle system; Resolvable cycle system maximum packing; Almost resolvable maximum packing; 05B30; 05C38;
D O I
暂无
中图分类号
学科分类号
摘要
If the complete graph Kn has vertex set X, a maximum packing of Kn with 4-cycles, (X, C, L), is an edge-disjoint decomposition of Kn into a collection C of 4-cycles so that the unused edges (the set L) is as small a set as possible. Maximum packings of Kn with 4-cycles were shown to exist by Schönheim and Bialostocki (Can. Math. Bull. 18:703–708, 1975). An almost parallel class of a maximum packing (X, C, L) of Kn with 4-cycles is a largest possible collection of vertex disjoint 4-cycles (so with \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\lfloor/4\rfloor}$$\end{document} 4-cycles in it). In this paper, for all orders n, except 9, which does not exist, and possibly 23, 41 and 57, we exhibit a maximum packing of Kn with 4-cycles so that the 4-cycles in the packing are resolvable into almost parallel classes, with any remaining 4-cycles being vertex disjoint. [Note: The three missing orders have now been found, and appear in Billington et al. (to appear).]
引用
收藏
页码:161 / 170
页数:9
相关论文
共 50 条
  • [41] The 4-choosability of plane graphs without 4-cycles
    Lam, PCB
    Xu, BG
    Liu, JZ
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1999, 76 (01) : 117 - 126
  • [42] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
  • [43] Linear Coloring of Planar Graphs Without 4-Cycles
    Wang, Weifan
    Wang, Yiqiao
    GRAPHS AND COMBINATORICS, 2013, 29 (04) : 1113 - 1124
  • [44] The maximum size of hypergraphs without generalized 4-cycles
    Pikhurko, Oleg
    Verstraete, Jacques
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 2009, 116 (03) : 637 - 649
  • [45] Linear Coloring of Planar Graphs Without 4-Cycles
    Weifan Wang
    Yiqiao Wang
    Graphs and Combinatorics, 2013, 29 : 1113 - 1124
  • [46] Decomposing Graphs of High Minimum Degree into 4-Cycles
    Bryant, Darryn
    Cavenagh, Nicholas J.
    JOURNAL OF GRAPH THEORY, 2015, 79 (03) : 167 - 177
  • [47] Classification of reconfiguration graphs of shortest path graphs with no induced 4-cycles
    Asplund, John
    Werner, Brett
    DISCRETE MATHEMATICS, 2020, 343 (0I)
  • [48] PARTITION OF EDGES OF DIRECTED COMPLETE GRAPH INTO 4-CYCLES
    SCHONHEIM, J
    DISCRETE MATHEMATICS, 1975, 11 (01) : 67 - 70
  • [49] Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
    Hou, Jianfeng
    Liu, Bin
    Liu, Guizhen
    Wang, Jihui
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2010, 87 (13) : 2880 - 2886
  • [50] Acyclic 4-Choosability of Planar Graphs Without 4-Cycles
    Sun, Yingcai
    Chen, Min
    CZECHOSLOVAK MATHEMATICAL JOURNAL, 2020, 70 (01) : 161 - 178