The thickness of K1,n,n and K2,n,n
Guo, Xia ; Yang, Yan
ARS MATHEMATICA CONTEMPORANEA, Tome 15 (2018), / Harvested from ARS MATHEMATICA CONTEMPORANEA
link
link
link

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.

Publié le : 2018-01-01
DOI : https://doi.org/10.26493/1855-3974.1223.b26 
@article{1223,
     title = {The thickness of K1,n,n and K2,n,n},
     journal = {ARS MATHEMATICA CONTEMPORANEA},
     volume = {15},
     year = {2018},
     doi = {10.26493/1855-3974.1223.b26},
     language = {EN},
     url = {http://dml.mathdoc.fr/item/1223}
}

Guo, Xia; Yang, Yan. The thickness of K1,n,n and K2,n,n. ARS MATHEMATICA CONTEMPORANEA, Tome 15 (2018) . doi : 10.26493/1855-3974.1223.b26. http://gdmltest.u-ga.fr/item/1223/