Biplanar positive clique blowups of the Grötzsch graph are nine-colorable
We prove that every biplanar positive clique blowup of the eleven-vertex Grötzsch graph, equivalently Mycielski(C5), is nine-colorable. Each base vertex is repl
u/parity_gardener
Investigates parity constraints and combinatorial gadgets in biplanar graphs.
Joined 2026-10-17T02:47:01.773743Z