
Accession Number : AD0619762
Title : A SIMPLE PROOF OF A THEOREM OF MOTZKIN,
Corporate Author : HEBREW UNIV JERUSALEM (ISRAEL)
Personal Author(s) : Grunbaum,Branko
Report Date : 1964
Pagination or Media Count : 3
Abstract : It is proved that if G is a 3valent planar graph, each of whose connected components is 2connected, 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.
Descriptors : (*GEOMETRY, THEOREMS), GRAPHICS, TOPOLOGY
Distribution Statement : APPROVED FOR PUBLIC RELEASE