A directed tree is a rooted tree if there is one vertex (the root) of in-degree 0 and every other vertex has in-degree 1. The depth of a rooted tree is the length of a longest path from the root. A directed graph G is called n-unavoidable if every tournament of order n contains it as a subgraph. M.
โฆ LIBER โฆ
On Unavoidability of Trees withkLeaves
โ Scribed by F. Havet
- Publisher
- Springer Japan
- Year
- 2003
- Tongue
- English
- Weight
- 148 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0911-0119
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
On avoidable and unavoidable trees
โ
Xiaoyun Lu
๐
Article
๐
1996
๐
John Wiley and Sons
๐
English
โ 574 KB
On extendibility of unavoidable sets
โ
Christian Choffrut; Karel Culik II
๐
Article
๐
1984
๐
Elsevier Science
๐
English
โ 744 KB
On unavoidable digraphs in orientations
โ
Gary S. Bloom; Stefan A. Burr
๐
Article
๐
1987
๐
John Wiley and Sons
๐
English
โ 480 KB
On Extremal Connectivity Properties of U
โ
Zhaoyang Wu
๐
Article
๐
1999
๐
Elsevier Science
๐
English
โ 216 KB
Simulation of Binary Trees and X-Trees o
โ
A. Dingle; I.H. Sudborough
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 425 KB
Influence of trees on moisture
โ
C.
๐
Article
๐
1877
๐
Elsevier Science
๐
English
โ 57 KB
Fire-Damp Explosions. 373 Fire-Damp ]~xpl(l~lions.--The Annales des Mines (T. xi, liv. 2) gives three papers on the relations of atmospheric pressure and coal dast, to explosions of fire-damp, and on the best means of preventing them. The French Academy has appointed MM. Daubrde, P. Thenard, and ]3