The 4-girth-thickness of the complete multipartite graph

Abstract

The $g$-girth-thickness $\theta (g,G)$ of a graph $G$ is the smallest number of planar subgraphs of girth at least $g$ whose union is $G$. In this paper, we calculate the $4$-girth-thickness $\theta (4,G)$ of the complete $m$-partite graph $G$ when each part has an even number of vertices.

6 pages, 1 figure

References in corpus (4)

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

Cited by in corpus (1)

• On the harmonious chromatic number of graphs