The 6-girth-thickness of the complete graph

Héctor Castañeda-López, Pablo C. Palomino, Andrea B. Ramos-Tort +2

The $g$-girth-thickness $\theta (g,G)$ of a graph $G$ is the minimum number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we determine the $6$-girth-thickn…