A conjecture on equitable vertex arboricity of graphs

DOI10.2298/FIL1401217ZzbMath1464.05159arXiv1211.4998WikidataQ122943777 ScholiaQ122943777MaRDI QIDQ2975465

Xin Zhang, Jian Liang Wu

Publication date: 11 April 2017

Published in: Filomat (Search for Journal in Brave)

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

zbMATH Keywords

maximum degreetree coloringrelaxed coloringequitable vertex arboricity

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (10)

Equitable vertex arboricity of subcubic graphs ⋮ On Equitable List Arboricity of Graphs ⋮ Equitable vertex arboricity of 5-degenerate graphs ⋮ Hardness and algorithms of equitable tree-coloring problem in chordal graphs ⋮ Equitable vertex arboricity conjecture holds for graphs with low degeneracy ⋮ Equitable vertex arboricity of planar graphs ⋮ 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

This page was built for publication: A conjecture on equitable vertex arboricity of graphs