# proof of a tree with two vertices of degree three

This is a practice question from the text.

The Question : Show that a tree with two vertices of degree $3$ must have at least four vertices of degree $1$. I have the answer to PART A.

Part B) Show that the result of Part (a) is the best possible i.e. a tree with two vertices of degree $3$ need not have five vertices of degree $1$.

I would really appreciate a hint that could help me solve part B.