Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have