Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices

被引：0
|
作者：
Dalibor Fronček
Petr Kovář
Michael Kubesa
机构：
[1] University of Minnesota Duluth,Department of Mathematics and Statistics
[2] VŠB – Technical University of Ostrava,Department of Applied Mathematics
来源：
Graphs and Combinatorics | 2011年 / 27卷
关键词：
Graph factorization; Spanning trees; Graph labeling;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
We give a complete characterization of trees with at most four non-leave vertices, which factorize the complete graph K2n.
引用
收藏
页码：621 / 646
页数：25
相关论文
共 22 条
  • [1] Factorizations of Complete Graphs into Trees with at most Four Non-Leave Vertices
    Froncek, Dalibor
    Kovar, Petr
    Kubesa, Michael
    GRAPHS AND COMBINATORICS, 2011, 27 (05) : 621 - 646
  • [2] Graceful trees and factorizations of complete graphs into non-symmetric isomorphic trees
    Kubesa, M
    UTILITAS MATHEMATICA, 2005, 68 : 79 - 86
  • [3] A characterization of graphs with at most four boundary vertices
    Chiem, Nick
    Dudarov, William
    Lee, Chris
    Lee, Sean
    Liu, Kevin
    JOURNAL OF COMBINATORICS, 2024, 15 (03) : 361 - 382
  • [4] Rainbow spanning trees in complete graphs colored by one-factorizations
    Horn, Paul
    JOURNAL OF GRAPH THEORY, 2018, 87 (03) : 333 - 346
  • [5] Factorizations of Complete Graphs into Spanning Trees with All Possible Maximum Degrees
    Kovar, Petr
    Kubesa, Michael
    COMBINATORIAL ALGORITHMS, 2009, 5874 : 334 - 344
  • [6] Commutative Zero-divisor Semigroups of Graphs with at Most Four Vertices
    Tang, Gaohua
    Su, Huadong
    Ren, Beishang
    ALGEBRA COLLOQUIUM, 2009, 16 (02) : 341 - 350
  • [7] A complete and equal computational complexity classification of compaction and retraction to all graphs with at most four vertices and some general results
    Vikas, N
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2005, 71 (04) : 406 - 439
  • [8] Edge-homotopy classification of spatial complete graphs on four vertices
    Nikkuni, R
    JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, 2004, 13 (06) : 763 - 777
  • [9] The spectral radius of graphs without trees of diameter at most four
    Hou, Xinmin
    Liu, Boyuan
    Wang, Shicheng
    Gao, Jun
    Lv, Chenhui
    LINEAR & MULTILINEAR ALGEBRA, 2021, 69 (08): : 1407 - 1414
  • [10] On Extremal Graphs with at Most Two Internally Disjoint Steiner Trees Connecting Any Three Vertices
    Li, Hengzhe
    Li, Xueliang
    Mao, Yaping
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2014, 37 (03) : 747 - 756
123