Equitable vertex arboricity of planar graphs

DOI10.11650/TJM.19.2015.4422zbMATH Open1357.05028arXiv1403.2810OpenAlexW2061202470MaRDI QIDQ514833FDOQ514833

Authors: Xin Zhang 

Publication date: 9 March 2017

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

Abstract: Let $G_1$ be a planar graph such that all cycles of length at most 4 are independent and let $G_2$ be a planar graph without 3-cycles and adjacent 4-cycles. It is proved that the set of vertices of $G_1$ and $G_2$ 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.

Full work available at URL: https://arxiv.org/abs/1403.2810

Recommendations

• On the equitable vertex arboricity of graphs
• On the vertex-arboricity of planar graphs
• A conjecture on equitable vertex arboricity of graphs
• Equitable partition of graphs into induced forests
• A note of vertex arboricity of planar graphs without 4-cycles intersecting with 6-cycles

zbMATH Keywords

equitable coloringplanar graphvertex arboricity

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cites Work

• Vertex and tree arboricities of graphs
• A conjecture on equitable vertex arboricity of graphs
• Equitable vertex arboricity of graphs
• The Point-Arboricity of Planar Graphs
• Bounds for the vertex linear arboricity
• Fractional Vertex Arboricity of Graphs

Cited In (13)

• Equitable vertex arboricity of subcubic graphs
• Title not available (Why is that?)
• Equitable vertex arboricity conjecture holds for graphs with low degeneracy
• On the equitable vertex arboricity of graphs
• Equitable partition of graphs into induced linear forests
• Equitable partition of plane graphs with independent crossings into induced forests
• Equitable vertex arboricity of 5-degenerate graphs
• Equitable partition of graphs into induced forests
• Equitable list point arboricity of graphs
• Maximizing and minimizing multiplicative Zagreb indices of graphs subject to given number of cut edges
• A conjecture on equitable vertex arboricity of graphs
• Fast algorithm of equitably partitioning degenerate graphs into graphs with lower degeneracy
• 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)