The 4-girth-thickness of the complete multipartite graph
Abstract
The g-girth-thickness θ(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 θ(4,G) of the complete m-partite graph G when each part has an even number of vertices.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.