Abstract
An equitablek-partition of a graph G is a collection of induced subgraphs (G[V1],G[V2],…,G[Vk]) of G such that (V1,V2,…,Vk) is a partition of V(G) and −1≤|Vi|−|Vj|≤1 for all 1≤i<j≤k. We prove that every planar graph admits an equitable 2-partition into 3-degenerate graphs, an equitable 3-partition into 2-degenerate graphs, and an equitable 3-partition into two forests and one graph.
Sign-in/Register to access full text options 
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
