2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/174332We show that every plane graph with maximum face size four whose all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5-colorable.Combinatorics05C15 (Primary); 05C10 (Secondary)text