2 problems

Let $P$ be an integral orthogonal polygon, meaning that all its edges have integer length, and let $N$ be its perimeter. The $N/6$ guard conjecture. The polygon $P$ can always be g…

Three-color guarding conjecture. Every simple polygon admits a weak conflict-free vertex-to-vertex chromatic guarding with at most $3$ colors.