The Non-Biplanar Character of the Complete 9-Graph
Canadian mathematical bulletin, Tome 6 (1963) no. 3, pp. 319-330
Voir la notice de l'article provenant de la source Cambridge University Press
Let us define a planar partition of a graph G as a pair {H1, H2} of subgraphs of G with the following properties (i) Each of H1 and H2 includes all the vertices of G. (ii) Each edge of G belongs to just one of H1 and H2. (iii) H1 and H2 are planar graphs. It is not required that H1 and H2 are connected. Moreover either of these graphs may have isolated vertices, incident with none of its edges.We describe a graph having a planar partition as biplanar.
Tutte, W. T. The Non-Biplanar Character of the Complete 9-Graph. Canadian mathematical bulletin, Tome 6 (1963) no. 3, pp. 319-330. doi: 10.4153/CMB-1963-026-x
@article{10_4153_CMB_1963_026_x,
author = {Tutte, W. T.},
title = {The {Non-Biplanar} {Character} of the {Complete} {9-Graph}},
journal = {Canadian mathematical bulletin},
pages = {319--330},
year = {1963},
volume = {6},
number = {3},
doi = {10.4153/CMB-1963-026-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1963-026-x/}
}
[1] 1. Dirac, G. A. and Schuster, S., A theorem of Kuratowski, Proc. of the Nederl. Ak. W., 57(1954), 343-348. Google Scholar
[2] 2. Battle, J., Harary, F. and Kodama, Y., Every planar graph with nine points has a non-planar complement, Bull. Amer. Math. Soc, 68(1962), 569-571. Google Scholar
[3] 3. Kuratowski, C., Sur le problème des courbes gauches en Topologie, Fundam. Math., 15(1930), 271-283. Google Scholar
[4] 4. Tutte, W. T., A census of planar triangulations, Can. J. Math. 14 (1962), 21-38. Google Scholar
Cité par Sources :