An equitable tree--coloring of a graph is a vertex coloring using distinct colors such that every color class (i.e, the set of vertices in a common color) induces a forest and the sizes of any two color classes differ by at most one. The minimum integer such that a graph is equitably tree--colorable is the equitable vertex arboricity of , denoted by . A graph that is equitably tree--colorable may admits no equitable tree--coloring for some . For example, the complete bipartite graph has an equitable tree--coloring but is not equitably tree-3-colorable. In view of this a new chromatic parameter so-called the equitable vertex arborable threshold is introduced. Precisely, it is the minimum integer such that has an equitable tree--coloring for any integer , and is denoted by . The concepts of the equitable vertex arboricity and the equitable vertex arborable threshold were introduced by J.-L. Wu, X. Zhang and H. Li in 2013. In 2016, X. Zhang also introduced the list analogue of the equitable tree--coloring. There are many interesting conjectures on the equitable (list) tree-colorings, one of which, for example, conjectures that every graph with maximum degree at most is equitably tree--colorable for any integer , i.e, . In this talk, I review the recent progresses on the studies of the equitable tree-colorings from theoretical results to practical algorithms, and also share some interesting problems for further research.