The thickness of a graph is the minimum number of planar subgraphs into which the graph can be decomposed. Determining the thickness for the complete bipartite graph is an unsolved problem in graph theory for over fifty years. Using a new planar decomposition for K4k − 4, 4k (k ≥ 4), we obtain the thickness of the complete bipartite graph Kn, n + 4, for n ≥ 1.
@article{1236,
title = {A note on the thickness of some complete bipartite graphs},
journal = {ARS MATHEMATICA CONTEMPORANEA},
volume = {14},
year = {2017},
doi = {10.26493/1855-3974.1236.4d7},
language = {EN},
url = {http://dml.mathdoc.fr/item/1236}
}
Hu, Siwei; Chen, Yichao. A note on the thickness of some complete bipartite graphs. ARS MATHEMATICA CONTEMPORANEA, Tome 14 (2017) . doi : 10.26493/1855-3974.1236.4d7. http://gdmltest.u-ga.fr/item/1236/