A tree is even if its edges can be colored in two colors so that the m
onochromatic subgraphs are isomorphic. All even trees of maximum degre
e 3 in which no two vertices of degrees 1 or 3 are adjacent are determ
ined. It is also shown that, for every n, there are only finitely many
trees of maximum degree 3 and with n vertices of degree 3 that are no
t even. (C) 1995 John Wiley & Sons, Inc.