A note on the vertex arboricity of signed graphs

Weichan Liu, Chen Gong, Lifang Wu +1

A signed tree-coloring of a signed graph $(G,\sigma )$ is a vertex coloring $c$ so that $G^c(i,\pm )$ is a forest for every $i\in c(u)$ and $u\in V(G)$, where $G^c(i,\pm )$ is the subg…