Spanning Trees: A Survey

被引：86
作者：
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
相关论文
共 203 条
[1]   TRANSVERSAL NUMBERS OF UNIFORM HYPERGRAPHS [J].
ALON, N .
GRAPHS AND COMBINATORICS, 1990, 6 (01) :1-4
[2]  
ALON N, ARXIVMATHCO08102053V
[3]  
Alon N, 2007, LECT NOTES COMPUT SC, V4855, P316
[4]  
Alon N, 2007, LECT NOTES COMPUT SC, V4596, P352
[5]  
[Anonymous], COMMUNICATION
[6]  
[Anonymous], 1970, CANADIAN MATH MONOGR
[7]  
[Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
[8]   Nonhamiltonian triangulations with large connectivity and representativity [J].
Archdeacon, D ;
Hartsfield, N ;
Little, CHC .
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1996, 68 (01) :45-55
[9]   Further analysis of the number of spanning trees in circulant graphs [J].
Atajan, Talip ;
Yong, Xuerong ;
Inaba, Hiroshi .
DISCRETE MATHEMATICS, 2006, 306 (22) :2817-2827
[10]   Maximal trees with bounded maximum degree in a graph [J].
Aung, M ;
Kyaw, A .
GRAPHS AND COMBINATORICS, 1998, 14 (03) :209-221
12345678910