Binary Trees With the Largest Number of Subtrees With at Least One Leaf

Research output: Contribution to conference › Presentation

Abstract

This talk was given during the Southeastern International Conference on Combinatorics, Graph Theory, and Computing.

Original language	American English
State	Published - Mar 2005
Event	Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) - Duration: Mar 6 2017 → …

Conference	Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC)
Period	03/6/17 → …

@conference{c7b434aa817543aebea7dccfab201718,

title = "Binary Trees With the Largest Number of Subtrees With at Least One Leaf",

abstract = " This talk was given during the Southeastern International Conference on Combinatorics, Graph Theory, and Computing.",

keywords = "Binary trees, Subtrees with at least one leaf",

author = "Hua Wang",

year = "2005",

month = mar,

language = "American English",

note = "Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC) ; Conference date: 06-03-2017",

}

TY - CONF

T1 - Binary Trees With the Largest Number of Subtrees With at Least One Leaf

AU - Wang, Hua

PY - 2005/3

Y1 - 2005/3

N2 - This talk was given during the Southeastern International Conference on Combinatorics, Graph Theory, and Computing.

AB - This talk was given during the Southeastern International Conference on Combinatorics, Graph Theory, and Computing.

KW - Binary trees

KW - Subtrees with at least one leaf

M3 - Presentation

T2 - Southeastern International Conference on Combinatorics, Graph Theory, and Computing (SEICCGTC)

Y2 - 6 March 2017

ER -