English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

An \emph{equitable $(q, r)$-tree-coloring} of a graph $G$ is a $q$-coloringof $G$ such that the subgraph induced by each color class is a forest ofmaximum degree at most $r$ and the sizes of any two color classes differ by atmost $1.$ Let the \emph{strong equitable vertex $r$-arboricity} of a graph $G,$denoted by $va^\equiv_r (G)$, be the minimum $p$ such that $G$ has an equitable$(q, r)$-tree-coloring for every $q\geq p.$  The values of $va^\equiv_1 (K_{n,n})$ were investigated by Tao and Lin andWu, Zhang, and Li where exact values of $va^\equiv_1 (K_{n,n})$ were found insome special cases. In this paper, we extend their results by giving the exactvalues of $va^\equiv_1 (K_{n,n})$ for all cases. In the process, we introduce anew function related to an equitable coloring and obtain a more general resultby determining the exact value of each $va^\equiv_1 (K_{m,n})$ and $va^\equiv_1(G)$ where $G$ is a balanced complete $k$-partite graph $K_{n,\ldots,n}.$

The strong equitable vertex 1-arboricity of complete bipartite graphs and balanced complete k-partite graphs