The 6-girth-thickness of the complete graph
Abstract
The g-girth-thickness θ(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 θ(6,Kn) of the complete graph Kn in almost all cases. And also, we calculate by computer the missing value of θ(4,Kn).
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.