Abstract
The equitable coloring problem, introduced by Meyer in 1973, has received considerable attention and research. Recently, Wu et al. introduced the concept of equitable (t,k)-tree-coloring, which can be viewed as a generalization of proper equitable t-coloring. Wu et al. investigated the strong equitable vertex k-arboricity of complete bipartite graphs. In this paper, we mainly investigate the strong equitable vertex 2-arboricity of complete tripartite graphs.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call