The Thickness of K₁,n,n and K₂,n,n
classification
🧮 math.CO
keywords
graphthicknesscompletepartiteminimumnumberobtainplanar
read the original 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 K_1,n,n, K_2,n,n and complete 4-partite graph K_1,1,n,n.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.