Research Article
Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two
Table 2
Trees connectable to a vertex
colored
in a two-hole tree with 1 and
as holes.
| Color of vertex | Connectable trees | Condition |
| | | and all colors less than adjacent to . | | and all colors greater than less than adjacent to . | | or and | | or and | | | | or |
| | | | | and all colors less than adjacent to | | and all colors greater than less than adjacent to . | | and | | | | or | | or | | and | | and |
| | | | | and all colors less than adjacent to | | and all colors greater than less than adjacent to . | | | | | | | | | | |
|
|