The Thickness of K1,n,n and K2,n,n
Abstract
The thickness of a graph G is the minimum number of planar subgraphs whose union is G. In this paper, we obtain the thickness of complete 3-partite graph K1,n,n, K2,n,n and complete 4-partite graph K1,1,n,n.
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.