Research Article
Infinitely Many Trees with Maximum Number of Holes Zero, One, and Two
Table 5
Trees connectable for a vertex colored
in a one-hole tree with
as the hole.
| Color of vertex | Connectable trees | Condition |
| | | and all colors less than adjacent to . | For , and all colors less than adjacent to . | | | | and or and | | | and is adjacent to . | | and or and | | | and is adjacent to . | | or |
| , | | and all colors less than adjacent to . | | | | or and | | |
|
|