Abstract
It is shown that a planar graph can be partitioned into three linear forests. The sharpness of the result is also considered.
Full Text
Sign-in/Register to access full text options
Published version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have