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 条
  • [31] Decomposing dense bipartite graphs into 4-cycles
    Cavenagh, Nicholas J.
    ELECTRONIC JOURNAL OF COMBINATORICS, 2015, 22 (01):
  • [32] FLEXIBILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Masarik, T.
    ACTA MATHEMATICA UNIVERSITATIS COMENIANAE, 2019, 88 (03): : 935 - 940
  • [33] PACKING AND COVERING OF COMPLETE GRAPH WITH 4-CYCLES
    SCHONHEIM, J
    BIALOSTOCKI, A
    CANADIAN MATHEMATICAL BULLETIN-BULLETIN CANADIEN DE MATHEMATIQUES, 1975, 18 (05): : 703 - 708
  • [34] EXTREMAL GRAPHS WITHOUT 3-CYCLES OR 4-CYCLES
    GARNICK, DK
    KWONG, YHH
    LAZEBNIK, F
    JOURNAL OF GRAPH THEORY, 1993, 17 (05) : 633 - 645
  • [35] Decompositions of Complete Multipartite Graphs into Cycles of Even Length
    Nicholas J. Cavenagh
    Elizabeth J. Billington
    Graphs and Combinatorics, 2000, 16 : 49 - 65
  • [36] Decompositions of complete multipartite graphs into cycles of even length
    Cavenagh, NJ
    Billington, EJ
    GRAPHS AND COMBINATORICS, 2000, 16 (01) : 49 - 65
  • [37] Equitable Δ-Coloring of Planar Graphs without 4-cycles
    Tan, Xiang
    OPERATIONS RESEARCH AND ITS APPLICATIONS, 2010, 12 : 400 - 405
  • [38] 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
  • [39] Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges
    Tian, Zihong
    Du, Yanke
    Kang, Qingde
    ARS COMBINATORIA, 2006, 81 : 257 - 279
  • [40] IMPROPER CHOOSABILITY OF PLANAR GRAPHS WITHOUT 4-CYCLES
    Wang, Yingqian
    Xu, Lingji
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (04) : 2029 - 2037
12345