Equitable vertex arboricity of subcubic graphs

DOI10.1016/j.disc.2016.02.003zbMath1333.05129OpenAlexW2285300769MaRDI QIDQ267194

Xin Zhang

Publication date: 8 April 2016

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2016.02.003

zbMATH Keywords

equitable coloringequitable partitionsubcubic graphvertex arboricity

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (7)

On Equitable List Arboricity of Graphs ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Theoretical aspects of equitable partition of networks into sparse modules ⋮ Complexity of tree-coloring interval graphs equitably ⋮ Equitable partition of graphs into induced linear forests ⋮ Equitable partition of plane graphs with independent crossings into induced forests

Cites Work

• Equitable vertex arboricity of graphs
• On acyclic colorings of planar graphs
• Equitable partition of graphs into induced forests
• A conjecture on equitable vertex arboricity of graphs
• The Point-Arboricity of Planar Graphs
• Acyclic colorings of planar graphs

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