On Sums of Valencies in Planar Graphs
- 1 April 1966
- journal article
- Published by Canadian Mathematical Society in Canadian Mathematical Bulletin
- Vol. 9 (1) , 111-114
- https://doi.org/10.4153/cmb-1966-016-x
Abstract
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.Keywords
This publication has 0 references indexed in Scilit: