2 problems

Let $G$ be a plane graph, and let $u$ be a positive integer. An $nu$-facial edge-coloring of $G$ is an edge-coloring in which all edges on every facial trail of length at most…

Fabrici et al.'s conjecture. If $G$ is a $2$-edge-connected plane graph, then