Article contents
On Sums of Valencies in Planar Graphs
Published online by Cambridge University Press: 20 November 2018
Extract
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.
- Type
- Notes and Problems
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1966
- 5
- Cited by