Remarks on the thickness of Kn, n, n
Yang, Yan
ARS MATHEMATICA CONTEMPORANEA, Tome 12 (2016), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

The thickness θ(G) of a graph G is the minimum number of planar subgraphs into which G can be decomposed. In this paper, we provide a new upper bound for the thickness of the complete tripartite graphs Kn, n, n (n ≥ 3) and obtain θ(Kn, n, n) = ⌈(n + 1) / 3⌉, when n ≡ 3 (mod 6).

Publié le : 2016-01-01
DOI : https://doi.org/10.26493/1855-3974.823.068 
@article{823,
     title = {Remarks on the thickness of Kn, n, n},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {12},
     year = {2016},
     doi = {10.26493/1855-3974.823.068},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/823}
}

Yang, Yan. Remarks on the thickness of Kn, n, n. ARS MATHEMATICA CONTEMPORANEA, Tome 12 (2016) . doi : 10.26493/1855-3974.823.068. http://gdmltest.u-ga.fr/item/823/