A SIMPLE PROOF OF A THEOREM OF MOTZKIN,
Abstract
It is proved that if G is a 3-valent planar graph, each of whose connected components is 2-connected, such that each face of G has a number of sides which is a multiple of 3, then the number of faces of G has parity different from the parity of the number of connected components of G.
Document Details
- Document Type
- Technical Report
- Publication Date
- Jan 01, 1964
- Accession Number
- AD0619762
Entities
People
- Branko Grunbaum
Organizations
- Hebrew University of Jerusalem