K1,p(2)-factorization of complete bipartite graphs

被引：21
作者：
Du, B [1 ]
机构：
[1] Suzhou Univ, Dept Math, Suzhou 215006, Peoples R China
来源：
DISCRETE MATHEMATICS | 1998年 / 187卷 / 1-3期
关键词：
complete bipartite graph; factorization;
D O I：
10.1016/S0012-365X(97)00264-1
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this note, we investigate the factorization of a bipartite multigraph lambda K-m,K-n into copies of K-1,K-p2 whenever p is a prime number. We give a trivial necessary condition for such a factorization to exist and a sufficient condition for the cases lambda = 1, lambda = p and lambda = p(2). (C) 1998 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：273 / 279
页数：7
相关论文
共 50 条
  • [41] An Algorithm for the Orientation of Complete Bipartite Graphs
    Zhao, Lingqi
    Wang, Mujiangshan
    Zhang, Xuefei
    Lin, Yuqing
    Wang, Shiying
    PROCEEDINGS OF THE 2017 INTERNATIONAL CONFERENCE ON APPLIED MATHEMATICS, MODELLING AND STATISTICS APPLICATION (AMMSA 2017), 2017, 141 : 361 - 364
  • [42] Complete bipartite graphs flexible in the plane
    Kovalev, M. D.
    Orevkov, S. Yu.
    SBORNIK MATHEMATICS, 2023, 214 (10) : 1390 - 1414
  • [43] Embedding Complete Bipartite Graphs into Wheel Related Graphs
    Greeni, A. Berin
    Joshwa, P. Leo
    JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS, 2023, 27 (04) : 645 - 648
  • [44] Crossing numbers of complete bipartite graphs
    Balogh, Jozsef
    Lidicky, Bernard
    Norin, Sergey
    Pfender, Florian
    Salazar, Gelasio
    Spiro, Sam
    XII LATIN-AMERICAN ALGORITHMS, GRAPHS AND OPTIMIZATION SYMPOSIUM, LAGOS 2023, 2023, 224 : 78 - 87
  • [45] Multicolored forests in complete bipartite graphs
    Brualdi, RA
    Hollingsworth, S
    DISCRETE MATHEMATICS, 2001, 240 (1-3) : 239 - 245
  • [46] On Ramsey (K1,m, g)-minimal graphs
    Borowiecka-Olszewska, Marta
    Haluszczak, Mariusz
    DISCRETE MATHEMATICS, 2013, 313 (19) : 1843 - 1855
  • [47] On k-graceful labeling of pendant edge extension of complete bipartite graphs
    Bhoumik, Soumya
    Mitra, Sarbari
    ALGEBRA & DISCRETE MATHEMATICS, 2018, 25 (02): : 188 - 199
  • [48] The crossing number of Cartesian products of complete bipartite graphs K2,m with paths Pn
    Ling, Tang
    Shengxiang, Lv
    Yuanqiu, Huang
    GRAPHS AND COMBINATORICS, 2007, 23 (06) : 659 - 666
  • [49] The Crossing Number of Cartesian Products of Complete Bipartite Graphs K2,m with Paths Pn
    Tang Ling
    Lv Shengxiang
    Huang Yuanqiu
    Graphs and Combinatorics, 2007, 23 : 659 - 666
  • [50] Terminal-pairability in complete bipartite graphs with non-bipartite demands Edge-disjoint paths in complete bipartite graphs
    Colucci, Lucas
    Erdos, Peter L.
    Gyori, Ervin
    Mezei, Tamas Robert
    THEORETICAL COMPUTER SCIENCE, 2019, 775 : 16 - 25
12345