$x \in X$ has its missing flag on an edge line $b_f$ or $r_f$, then this indicates that the vertex $x \in X$ is covered by the edge $f \in F$ in the hypergraph $H$. In that case, the color of $x$ is determined by flipping the configuration (either upside down or left to right) on the vertex line that corresponds to $x$. As demonstrated in Figure \[fig:colorfix\], the colors of some vertices in $H$ might be determined by the vertices in $V$. In this particular example, $u,v \in V$ are adjacent vertices, and $w$ is neighboring none of them. Therefore, neither $u$ nor $v$ can flip horizontally, and they must flip vertically together. This means that the color of the vertices $x,y \in X$ covered by the edge $f \in F$ in $H$ is determined by the vertices $u, v, w \in V$.

On each vertex line, there are five flags. If an edge has a “missing” flag on one side then that means that edge covers the vertex, and is colored according to the color of the edge line which is missing the flag. Remember that the Euclidean distance between consecutive vertex lines is less than $3$ units. 