Hostname: page-component-745bb68f8f-s22k5 Total loading time: 0 Render date: 2025-01-20T03:58:13.198Z Has data issue: false hasContentIssue false
  • English
  • Français

On Sums of Valencies in Planar Graphs

Published online by Cambridge University Press:  20 November 2018

Robert Bowen
Robert Bowen*
Affiliation:
University of California, Berkeley
Rights & Permissions [Opens in a new window]

Extract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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
Canadian Mathematical Bulletin , Volume 9 , Issue 1 , April 1966 , pp. 111 - 114
Copyright
Copyright © Canadian Mathematical Society 1966