Equitable vertex arboricity of planar graphs
From MaRDI portal
Publication:514833
Abstract: Let be a planar graph such that all cycles of length at most 4 are independent and let be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of and can be equitably partitioned into subsets for every so that each subset induces a forest. These results partially confirm a conjecture of Wu, Zhang and Li.
Recommendations
Cites work
Cited in
(13)- Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
- Equitable vertex arboricity conjecture holds for graphs with low degeneracy
- Equitable list point arboricity of graphs
- On the equitable vertex arboricity of graphs
- Equitable partition of graphs into induced forests
- Equitable partition of graphs into induced linear forests
- Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
- Equitable vertex arboricity of 5-degenerate graphs
- Equitable partition of plane graphs with independent crossings into induced forests
- A conjecture on equitable vertex arboricity of graphs
- Equitable vertex arboricity of subcubic graphs
- scientific article; zbMATH DE number 7266381 (Why is no real title available?)
- Equitable partition of planar graphs
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)