Preprint
Aug 2026
Three-edge-coloring apex cubic graphs
A graph $G$ is \emph{apex} if $G$ has a vertex $v$ such that $G-v$ is planar. We prove that every $2$-connected apex cubic graph is three-edge-colorable. This result gives the final piece of the proof for the well-known Tutte's three-edge-coloring conjecture from 1966 \cite{tutte}. The proof, as well as the result, gen...
Yuta Inoue, K. Kawarabayashi, Rintaro Matsuo et al.
· 1 citation