Equitable vertex arboricity of planar graphs

From MaRDI portal
Publication:514833




Abstract: Let G1 be a planar graph such that all cycles of length at most 4 are independent and let G2 be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of G1 and G2 can be equitably partitioned into t subsets for every tgeq3 so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li.









This page was built for publication: Equitable vertex arboricity of planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514833)