Elsevier

Discrete Mathematics

Volume 91, Issue 1, 7 August 1991, Pages 91-94
Discrete Mathematics

Note
Acyclic colorings of planar graphs

https://doi.org/10.1016/0012-365X(91)90166-YGet rights and content
Under an Elsevier user license
open archive

Abstract

It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the result is also considered.

Cited by (0)