The Slimming Number and Genus of Graphs
Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 195-200
Voir la notice de l'article provenant de la source Cambridge
J. Ch. Boland suggested, and Mrs. Sheehan named, the idea of the slimming number of a graph G, i.e. the minimum number, s(G), of edges, e 1e 2,..., e s, which must be removed from G in order that G—∪ e i be planar.For the complete graph, K n (n≥3), it may be seen by Euler's formula that a planar subgraph contains at most 3n—6 edges; moreover one may construct such a subgraph inductively, starting from K 3, and adding points successively, joining them to the three vertices of the region in which they lie, so 1
Guy, Richard K. The Slimming Number and Genus of Graphs. Canadian mathematical bulletin, Tome 15 (1972) no. 2, pp. 195-200. doi: 10.4153/CMB-1972-035-8
@article{10_4153_CMB_1972_035_8,
author = {Guy, Richard K.},
title = {The {Slimming} {Number} and {Genus} of {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {195--200},
year = {1972},
volume = {15},
number = {2},
doi = {10.4153/CMB-1972-035-8},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1972-035-8/}
}
Cité par Sources :