On Sums of Valencies in Planar Graphs
Canadian mathematical bulletin, Tome 9 (1966) no. 1, pp. 111-114
Voir la notice de l'article provenant de la source Cambridge
Planarity in graphs implies relatively small valencies and numbers of edges. In this note we find the maximum sum of valencies and the maximum number of incident edges for a set of n vertices in a planar graph with v vertices. Graphs considered are without multiple edges or loops.
Bowen, Robert. On Sums of Valencies in Planar Graphs. Canadian mathematical bulletin, Tome 9 (1966) no. 1, pp. 111-114. doi: 10.4153/CMB-1966-016-x
@article{10_4153_CMB_1966_016_x,
author = {Bowen, Robert},
title = {On {Sums} of {Valencies} in {Planar} {Graphs}},
journal = {Canadian mathematical bulletin},
pages = {111--114},
year = {1966},
volume = {9},
number = {1},
doi = {10.4153/CMB-1966-016-x},
url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1966-016-x/}
}
Cité par Sources :