The 6-girth-thickness of the complete graph

Abstract

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-thickness $\theta (6,K_n)$ of the complete graph $K_n$ in almost all cases. And also, we calculate by computer the missing value of $\theta (4,K_n)$.

10 pages, 8 figures

References in corpus (3)

• House of Graphs: a database of interesting graphs
• Complete colorings of planar graphs
• The 4-girth-thickness of the complete graph

Cited by in corpus (1)

• The 4-girth-thickness of the complete multipartite graph