Maximum Hexagon Packing of Kv-L Where L is a 2-regular Subgraph

被引：0
|
作者：
Pu, Liqun [1 ]
Chai, Yanling [1 ]
Bu, Hailin [1 ]
机构：
[1] Zhengzhou Univ, Dept Math, Zhengzhou 450001, Peoples R China
来源：
ARS COMBINATORIA | 2013年 / 112卷
关键词：
6-cycle; Complete graph; Maximum packing; CYCLE DECOMPOSITIONS; SYSTEMS; LEAVES; DESIGNS; GRAPHS;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we extend the study on packing complete graph K-v with 6-cycles. Mainly, the maximum packing of K-v - L and a leave are obtained where L is a vertex-disjoint union of cycles in K-v.
引用
收藏
页码：225 / 237
页数：13
相关论文
共 50 条
  • [1] Maximum Hexagon Packing of Kv F Where F is a Spanning Forest
    Liqun PU 1
    2.Department of Mathematics
    Journal of Mathematical Research with Applications, 2012, (02) : 143 - 156
  • [2] (C)over-right-arrow4-decompositions of Dv\P and Dv ∨ P where P is a 2-regular subgraph of Dv
    Pu, Liqun
    Fu, Hung-Lin
    Shen, Hao
    GRAPHS AND COMBINATORICS, 2006, 22 (04) : 515 - 525
  • [3] On labeling 2-regular graphs where the number of odd components is at most 2
    Bunge, R. C.
    El-Zanati, S. I.
    Hirsch, M.
    Klope, D.
    Mudrock, J. A.
    Sebesta, K.
    Shafer, B.
    UTILITAS MATHEMATICA, 2013, 91 : 261 - 285
  • [4] On 2-regular graphs whose girth is one less than the maximum
    Knyazev, A.V.
    Discrete Mathematics and Applications, 2002, 12 (03): : 303 - 318
  • [5] [inline-graphic not available: see fulltext]-Decompositions of [inline-graphic not available: see fulltext] and Dv∪P where P is a 2-Regular Subgraph of Dv
    Liqun Pu
    Hung-Lin Fu
    Hao Shen
    Graphs and Combinatorics, 2006, 22 (4) : 515 - 525
  • [6] Geometric Hyperplanes of the Near Hexagon L3 × GQ(2, 2)
    Metod Saniga
    Péter Lévay
    Michel Planat
    Petr Pracna
    Letters in Mathematical Physics, 2010, 91
  • [7] L1 and L2 dialects: Where the action is
    Preston, Dennis R.
    Ocumpaugh, Jaclyn
    Roeder, Rebecca
    LENGUA Y MIGRACION-LANGUAGE AND MIGRATION, 2009, 1 (02): : 5 - 21
  • [8] IDEALS OF REGULAR OPERATORS ON L2
    ARENDT, W
    SOUROUR, AR
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1983, 88 (01) : 93 - 96
  • [9] Fast partitioning l-apex graphs with applications to approximating maximum induced-subgraph problems
    Thilikos, DM
    Bodlaender, HL
    INFORMATION PROCESSING LETTERS, 1997, 61 (05) : 227 - 232
  • [10] Bounding quantities related to the packing density of 1 (l+1)l•••2
    Hildebrand, M
    Sagan, BE
    Vatter, VR
    ADVANCES IN APPLIED MATHEMATICS, 2004, 33 (03) : 633 - 653
12345