Accession Number:

AD0619762

Title:

A SIMPLE PROOF OF A THEOREM OF MOTZKIN,

Descriptive Note:

Corporate Author:

HEBREW UNIV JERUSALEM (ISRAEL)

Personal Author(s):

Report Date:

1964-01-01

Pagination or Media Count:

3.0

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.

Subject Categories:

Distribution Statement:

APPROVED FOR PUBLIC RELEASE