Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two

Table 1

Trees connectable to a vertex colored in a two-hole tree with 1 and 3 as holes.

Color of vertex	Connectable trees	Condition
	and all colors greater than less than adjacent to .
		and all colors less than adjacent to .
		and all colors less than adjacent to .
	c>
			and all colors greater than less than adjacent to .
			and
			and