The thickness of K1,n,n and K2,n,n

Xia Guo, Yan Yang

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.


Keywords


Thickness, complete 3-partite graph, complete 4-partite graph

Full Text:

PDF ABSTRACTS (EN/SI)


DOI: https://doi.org/10.26493/1855-3974.1223.b26

ISSN: 1855-3974

Issues from Vol 6, No 1 onward are partially supported by the Slovenian Research Agency from the Call for co-financing of scientific periodical publications