The point-outerthickness of complete n-partite graphs
Compositio Mathematica, Tome 29 (1974) no. 1, pp. 55-61. 
@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://www.numdam.org/item/CM_1974__29_1_55_0/}
}
TY  - JOUR
AU  - Mitchem, John
TI  - The point-outerthickness of complete $n$-partite graphs
JO  - Compositio Mathematica
PY  - 1974
SP  - 55
EP  - 61
VL  - 29
IS  - 1
PB  - Noordhoff International Publishing
UR  - http://www.numdam.org/item/CM_1974__29_1_55_0/
LA  - en
ID  - CM_1974__29_1_55_0
ER  - 
%0 Journal Article
%A Mitchem, John
%T The point-outerthickness of complete $n$-partite graphs
%J Compositio Mathematica
%D 1974
%P 55-61
%V 29
%N 1
%I Noordhoff International Publishing
%U http://www.numdam.org/item/CM_1974__29_1_55_0/
%G en
%F 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://www.numdam.org/item/CM_1974__29_1_55_0/

[1] L.W. Beineke: 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] L.W. Beineke, F. Harary and J.W. Moon: On the thickness of the complete bipartite graph. Proc. Cambridge Philos. Soc., 60 (1964) 1-5. | MR | Zbl

[3] G. Chartrand, D. Geller and S. Hedetniemi: Graphs with forbidden subgraphs. J. Combinatorial Theory, 10 (1971) 12-41. | MR | Zbl

[4] G. Chartrand and H.V. Kronk: The point-arboricity of planar graphs. J. London Math. Soc., 44 (1969) 612-616. | MR | Zbl

[5] G. Chartrand, H.V. Kronk and C.E. Wall: The point-arboriticy of a graph. Israel J. Math., 6 (1968) 169-175. | MR | Zbl

[6] F. Harary: Graph Theory. Addison-Wesley, Reading, Mass. 1969, 120-121. | MR | Zbl

[7] J. Mayer: Decomposition de K16 en trois graphes planaires. J. Combinatorial Theory (B), 13 (1972) 71. | Zbl

[8] J. Mitchem: Uniquely k-arborable graphs. Israel J. Math., 10 (1971) 17-25. | MR | Zbl

[9] St J.A. Nash-Williams: Edge-disjoint spanning trees of finite graphs. J. London Math. Soc., 36 (1961) 445-450. | MR | Zbl