Greedy Trees, Subtrees and Antichains

Electronic Journal Of Combinatorics

Eric Ould Dadah Andriantiana¹ 

关键词: Greedy trees;    Degree sequences;    subtrees;    antichains;   

DOI  :  

学科分类：离散数学和组合数学

来源: Electronic Journal Of Combinatorics

【 摘 要 】

Greedy trees are constructed from a given degree sequence by a simple greedy algorithm that assigns the highest degree to the root, the second-, third-, ... highest degrees to the root's neighbors, and so on. 

【 授权许可】

Others