A note on the 4-girth-thickness of K_{n,n,n}

Xia Guo, Yan Yang

The $4$-girth-thickness $\theta (4,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least four whose union is $G$. In this paper, we obtain that the 4-girth-thick…