Defines distance partition (BFS layers from a chosen vertex) and the diamond
scaffold of a maximal planar graph (G with all same-level edges removed),
then proves the diamond scaffold is 2-colorable by parity of level.
Co-Authored-By: Claude Opus 4.7 <noreply@anthropic.com>
