
This paper mainly proves that if a connected graph \(G= (V,E)\) is neither a cycle nor a clique, then there is a coloring of \(V\) with at most \(\lceil {{\Delta (G)} \over 2} \rceil\) colors such that all color classes induce forests and one of them is a minimum induced forest in \(G\).
forests, maximum degree, arboricity, Chromatic number, Arboricity, colors, Theoretical Computer Science, Vertex arboricity, Coloring of graphs and hypergraphs, chromatic number, Discrete Mathematics and Combinatorics, coloring
forests, maximum degree, arboricity, Chromatic number, Arboricity, colors, Theoretical Computer Science, Vertex arboricity, Coloring of graphs and hypergraphs, chromatic number, Discrete Mathematics and Combinatorics, coloring
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 16 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
