A SIMPLE PROOF OF A THEOREM OF MOTZKIN,

reportActive / Technical Report | Accession Number: AD0619762 | Need Help?

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.

Author(s):
Grunbaum, Branko
Author Organization(s):
HEBREW UNIV JERUSALEM (ISRAEL)
Supplementary Note:
Pub. in Akademie van Wetenschappen, Amsterdam. Proceedings, series A v67 n4 and Indag. Math. v26 n4 p382-4 1964. (Copies available only to DDC users).
Annotation:
Reprint: Simple proof of Motzkin's theorem.
Pagination:
0003

Security Markings

DOCUMENT & CONTEXTUAL SUMMARY

Distribution:
Approved For Public Release

RECORD

Collection: TR
Identifying Numbers
Report Number(s):
AFOSR-65-1032
Contract/Grant Number(s):
AF EOAR63 63
Monitor Series:
65-1032
 Subject Terms
Communities of Interest:
No COI(s) Identified
Descriptor(s):
(*GEOMETRY, THEOREMS), GRAPHICS, TOPOLOGY
Report Date:
1964 Jan 01