The 4-girth-thickness of the complete graph
Christian Rubio-Montiel · Ars Mathematica Contemporanea · 2017
In this paper, we define the 4-girth-thickness θ(4, G) of a graph G as the minimum number of planar subgraphs of girth at least 4 whose union is G. We prove that the 4-girth-thickness of an arbitrary complete graph Kn, θ(4, Kn), is ⌈(n+2)/4⌉ for n ≠ 6, 10 and θ(4, K6)=3.