On Sums of Valencies in Planar Graphs
Robert Bowen · Canadian Mathematical Bulletin · 1966
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.