Solutions to All-Colors Problem on Graph Cellular Automata

<p>A caterpillar <span class="nowrap"><svg height="9.01194pt" id="M275" style="vertical-align:-0.04981995pt" version="1.1" viewbox="-0.0498162 -8.96212 8.41168 9.01194" width="8.41168pt" xmlns="http://www.w3.org/2000/svg"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M620 675H597C578 656 570 650 541 650H144C112 650 104 653 94 675H72C59 618 42 552 23 493L53 491C71 534 88 564 105 585C124 608 144 615 238 615H290L197 121C182 40 174 34 88 28L82 0H361L367 28C275 34 266 38 281 121L374 615H441C522 615 543 608 553 583C562 560 566 531 565 493L597 494C603 551 612 629 620 675Z"></path></g></svg>.</span></p>

Complexity

Solutions to All-Colors Problem on Graph Cellular Automata

Figure 2