@article{CM_1974__29_1_55_0, author = {Mitchem, John}, title = {The point-outerthickness of complete $n$-partite graphs}, journal = {Compositio Mathematica}, pages = {55--61}, publisher = {Noordhoff International Publishing}, volume = {29}, number = {1}, year = {1974}, mrnumber = {354450}, zbl = {0291.05104}, language = {en}, url = {http://archive.numdam.org/item/CM_1974__29_1_55_0/} }
Mitchem, John. The point-outerthickness of complete $n$-partite graphs. Compositio Mathematica, Tome 29 (1974) no. 1, pp. 55-61. http://archive.numdam.org/item/CM_1974__29_1_55_0/
[1] Complete bipartite graphs: decomposition into planar subgraphs, A Seminar in Graph Theory (F. Harary, ed.) Holt, Rinehart and Winston, New York, 1967, 42-53. | MR | Zbl
:[2] On the thickness of the complete bipartite graph. Proc. Cambridge Philos. Soc., 60 (1964) 1-5. | MR | Zbl
, and :[3] Graphs with forbidden subgraphs. J. Combinatorial Theory, 10 (1971) 12-41. | MR | Zbl
, and :[4] The point-arboricity of planar graphs. J. London Math. Soc., 44 (1969) 612-616. | MR | Zbl
and :[5] The point-arboriticy of a graph. Israel J. Math., 6 (1968) 169-175. | MR | Zbl
, and :[6] Graph Theory. Addison-Wesley, Reading, Mass. 1969, 120-121. | MR | Zbl
:[7] Decomposition de K16 en trois graphes planaires. J. Combinatorial Theory (B), 13 (1972) 71. | Zbl
:[8] Uniquely k-arborable graphs. Israel J. Math., 10 (1971) 17-25. | MR | Zbl
:[9] Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36 (1961) 445-450. | MR | Zbl
: