Sebastien Bonduelle, František Kardoš·2021-08-13·via math.CO updates on arXiv.org
We prove that planar graphs of maximum degree 3 and of girth at least 7 are 3-edge-colorable, extending the previous result for girth at least 8 by Kronk, Radlowski, and Franen from 1974.