Solutions to All-Colors Problem on Graph Cellular Automata

<p>A tree without solution to the SACP for <span class="nowrap"><svg height="9.46863pt" id="M216" style="vertical-align:-1.11981pt" version="1.1" viewbox="-0.0498162 -8.34882 31.5818 9.46863" width="31.5818pt" xmlns="http://www.w3.org/2000/svg"><g transform="matrix(.013,0,0,-0.013,0,0)"><path d="M766 88L752 113C719 83 690 64 681 64C674 64 672 74 679 103L724 292C758 436 724 448 701 448C680 448 666 442 639 429C594 407 514 350 441 252H439L447 289C476 423 450 448 419 448C398 448 379 441 355 427C307 400 234 344 162 249H160L180 324C203 409 197 448 170 448C144 448 82 413 23 349L35 321C57 343 96 374 108 374C115 374 117 371 111 341C87 227 57 112 24 -6L32 -12C53 -4 81 4 108 6C119 68 134 128 149 171C177 229 309 383 364 383C387 383 388 355 373 282C354 190 330 92 303 -6L309 -12C332 -4 356 3 386 6C396 63 411 122 424 171C458 236 590 383 642 383C658 383 664 369 652 315L603 91C587 20 593 -12 619 -12C642 -12 708 23 766 88Z"></path></g><g transform="matrix(.013,0,0,-0.013,13.889,0)"><path d="M531 285V335L57 550V494L473 310L57 127V71L531 285ZM531 -40V10H57V-40H531Z"></path></g><g transform="matrix(.013,0,0,-0.013,25.152,0)"><path d="M285 378C315 398 338 416 353 432C373 451 384 474 384 503C384 579 325 635 236 635H235C182 635 136 610 108 579L65 516L85 496C110 533 150 575 205 575C258 575 300 543 300 481C300 407 232 369 141 339L147 310C163 315 188 321 211 321C268 321 338 284 338 192C338 94 288 40 217 40C160 40 119 68 93 91C85 98 77 97 69 91C60 84 47 71 46 58C44 46 48 35 62 22C75 10 116 -12 162 -12C234 -12 424 62 424 224C424 297 373 359 285 376V378Z"></path></g></svg>.</span></p>

Complexity

Solutions to All-Colors Problem on Graph Cellular Automata

Figure 1