Spanning Trees: A Survey

被引：82
|
作者：
Ozeki, Kenta [2 ]
Yamashita, Tomoki [1 ]
机构：
[1] Kitasato Univ, Coll Liberal Arts & Sci, Minami Ku, Kanagawa 2520373, Japan
[2] Natl Inst Informat, Chiyoda Ku, Tokyo 1018430, Japan
来源：
GRAPHS AND COMBINATORICS | 2011年 / 27卷 / 01期
关键词：
Spanning trees; k-Trees; k-Ended trees; Branch vertices; k-Leaf connected; DEGREE-PRESERVING VERTICES; MINIMUM DEGREE CONDITION; NETWORK DESIGN PROBLEM; LINEAR-TIME ALGORITHM; MAXIMUM LEAF PROBLEMS; CUBIC GRAPHS; INDEPENDENT TREES; CIRCULANT GRAPHS; STEINER TREES; APPROXIMATION ALGORITHMS;
D O I：
10.1007/s00373-010-0973-2
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this paper, we give a survey of spanning trees. We mainly deal with spanning trees having some particular properties concerning a hamiltonian properties, for example, spanning trees with bounded degree, with bounded number of leaves, or with bounded number of branch vertices. Moreover, we also study spanning trees with some other properties, motivated from optimization aspects or application for some problems.
引用
收藏
页码：1 / 26
页数：26
相关论文
共 50 条
  • [1] Spanning Trees: A Survey
    Kenta Ozeki
    Tomoki Yamashita
    Graphs and Combinatorics, 2011, 27 : 1 - 26
  • [2] Independent Spanning Trees in Networks: A Survey
    Cheng, Baolei
    Wang, Dajin
    Fan, Jianxi
    ACM COMPUTING SURVEYS, 2023, 55 (14S)
  • [3] Spanning Trees
    Akiyama, Jin
    Kano, Mikio
    FACTORS AND FACTORIZATIONS OF GRAPHS: PROOF TECHNIQUES IN FACTOR THEORY, 2011, 2031 : 295 - 336
  • [4] SPANNING TREES
    不详
    JOURNAL OF HUMANISTIC MATHEMATICS, 2021, 11 (02): : 481 - 482
  • [5] From Spanning Trees to Meshed Trees
    Acharya, H. B.
    Hamilton, John
    Shenoy, Nirmala
    2020 INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS (COMSNETS), 2020,
  • [6] Packing spanning trees
    1600, Inst of Management Sciences, Providence, RI, USA (20):
  • [7] On Polynomials of Spanning Trees
    F. Chung
    C. Yang
    Annals of Combinatorics, 2000, 4 (1) : 13 - 25
  • [8] Generalized spanning trees
    Dror, M
    Haouari, M
    Chaouachi, J
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 120 (03) : 583 - 592
  • [9] Minimal spanning trees
    Schmerl, JH
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 2004, 132 (02) : 333 - 340
  • [10] On encodings of spanning trees
    Hurlbert, Glenn H.
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (18) : 2594 - 2600
12345