On the Equitable Vertex Arboricity of Graphs
Yaping Mao, Zhiwei Guo, Hongjian Lai, Haixing Zhao

TL;DR
This paper investigates the equitable vertex arboricity in various graph classes, providing bounds, characterizations, and Nordhaus-Gaddum results for the strong equitable vertex k-arboricity.
Contribution
It introduces new bounds and characterizations for the strong equitable vertex k-arboricity in bipartite, tripartite graphs, and forests, extending previous work and providing comprehensive results.
Findings
Sharp upper bound for complete bipartite graphs $K_{n,n+ ext{l}}$
Necessary and sufficient conditions for equitable $(q, ext{infty})$-tree coloring
Characterizations of graphs with specific strong equitable vertex k-arboricity values
Abstract
The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu, Zhang and Li introduced the concept of equitable -tree-coloring, which can be regarded as a generalization of proper equitable -coloring. The \emph{strong equitable vertex -arboricity} of , denoted by , is the smallest integer such that has an equitable -tree-coloring for every . The exact value of strong equitable vertex -arboricity of complete equipartition bipartite graph was studied by Wu, Zhang and Li. In this paper, we first get a sharp upper bound of strong equitable vertex arboricity of complete bipartite graph, that is, . Next, we obtain a sufficient and necessary…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Interconnection Networks and Systems
