Discrete MathematicsVolume 91, Issue 1, 7 August 1991, Pages 91-94NoteAcyclic colorings of planar graphsAuthor links open overlay panelWayne GoddardShow moreShareCitehttps://doi.org/10.1016/0012-365X(91)90166-YGet rights and contentUnder an Elsevier user licenseopen archiveAbstractIt is shown that a planar graph can be partitioned into three linear forests. The sharpness of the result is also considered.Previous article in issueNext article in issueRecommended articlesCited by (0)Copyright © 1991 Published by Elsevier B.V.