Abstract
An (Fd1,Fd2)-partition of a graph G is a partition of V(G) into two subsets V1 and V2 such that G[Vi] is a forest with maximum degree at most di for i=1,2. In this paper we show that every planar graph without 4-cycles and 6-cycles has an (F5,F5)-partition. This improves a result by Huang, Huang and Lv in 2023, which says that G has an (F2,F)-partition.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
