Decompositions of Various Complete Graphs into Isomorphic Copies of 4-cycles with Three Pendant Edges

被引：0
|
作者：
Abueida, Atif [1 ]
Alzahrani, Rabab [1 ]
机构：
[1] Department of Mathematics, University of Dayton, 300 College Park, Dayton,OH,45469-2316, United States
来源：
Journal of Combinatorial Mathematics and Combinatorial Computing | 2019年 / 111卷
关键词：
Graph theory;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
An H-decomposition of a graph G is a partition of the edges of G into copies isomorphic to H. When the decomposition is not feasible, one looks for the best possible by minimizing; the number of unused edges (leave of a packing), or the number of reused edges (padding of a covering). We consider the H-decomposition, packing, and covering of the complete graphs and complete bipartite graphs, where H is a 4-cycle with three pendant edges. © 2019 Charles Babbage Research Centre. All rights reserved.
引用
收藏
页码：53 / 64
相关论文
共 50 条
  • [21] Extremal graphs without 4-cycles
    Firke, Frank A.
    Kosek, Peter M.
    Nash, Evan D.
    Williford, Jason
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2013, 103 (03) : 327 - 336
  • [22] ON EXTREMAL GRAPHS WITHOUT 4-CYCLES
    YANG, YS
    UTILITAS MATHEMATICA, 1992, 41 : 204 - 210
  • [23] ON THE NUMBER OF GRAPHS WITHOUT 4-CYCLES
    KLEITMAN, DJ
    WINSTON, KJ
    DISCRETE MATHEMATICS, 1982, 41 (02) : 167 - 172
  • [24] Decompositions of line graphs of complete graphs into paths and cycles
    Ganesamurthy, S.
    DISCRETE MATHEMATICS, 2023, 346 (01)
  • [25] Decompositions of complete graphs into triangles and Hamilton cycles
    Bryant, D
    Maenhaut, B
    JOURNAL OF COMBINATORIAL DESIGNS, 2004, 12 (03) : 221 - 232
  • [26] On decompositions of complete graphs into unicyclic disconnected bipartite graphs on nine edges
    Bohnert, Alan
    Branson, Luke
    Otto, Patrick
    ELECTRONIC JOURNAL OF GRAPH THEORY AND APPLICATIONS, 2023, 11 (01) : 329 - 341
  • [27] Decompositions of complete graphs into theta graphs with fewer than ten edges
    Blinco, A
    UTILITAS MATHEMATICA, 2003, 64 : 197 - 212
  • [28] The regularity method for graphs with few 4-cycles
    Conlon, David
    Fox, Jacob
    Sudakov, Benny
    Zhao, Yufei
    JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2021, 104 (05): : 2376 - 2401
  • [29] GRAPHS OF DIAMETER 3 WITHOUT 4-CYCLES
    PAREEK, CM
    UTILITAS MATHEMATICA, 1985, 28 : 29 - 41
  • [30] Sidon sets and graphs without 4-cycles
    Tait, Michael
    Timmons, Craig
    JOURNAL OF COMBINATORICS, 2014, 5 (02) : 155 - 165
12345