Two criteria for a tree to have an f-factor and (g, f)-factors are presented, respectively. They simplify, respectively, Tutte's condition for a graph to havef-factors and Lov~sz's condition for a graph to have (g,f)-factors. An O(j V(T)/) algorithm and an O(l V(T)I') algorithm for f-factor and (g,
Safety Factors in Trees
✍ Scribed by C. Mattheck; K. Bethge; J. Schäfer
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 550 KB
- Volume
- 165
- Category
- Article
- ISSN
- 0022-5193
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Simion, R., Trees with l-factors and oriented trees, Discrete Mathematics 88 (1991) 93-104. In this paper we present some results on trees with a l-factor: generating functions and asymptotics for the number of such trees, labeled, rooted, planted and unlabeled. We show that almost all trees with a
## Abstract A tree is even if its edges can be colored in two colors so that the monochromatic subgraphs are isomorphic. All even trees of maximum degree 3 in which no two vertices of degrees 1 or 3 are adjacent are determined. It is also shown that, for every __n__, there are only finitely many tr