2 research outputs found
The 4-girth-thickness of the complete multipartite graph
The -girth-thickness of a graph is the smallest number
of planar subgraphs of girth at least whose union is . In this paper, we
calculate the -girth-thickness of the complete -partite
graph when each part has an even number of vertices.Comment: 6 pages, 1 figur