# Accession Number:

## AD0649062

# Title:

## SOME INTERPOLATION THEOREMS FOR PARTITIONS OF GRAPHS.

# Descriptive Note:

## Technical rept.,

# Corporate Author:

## MICHIGAN UNIV ANN ARBOR LOGIC OF COMPUTERS GROUP

# Personal Author(s):

# Report Date:

## 1967-03-01

# Pagination or Media Count:

## 15.0

# Abstract:

The paper considers certain partitions of the set of points and of the set of lines of a graph and defines for each such partition a corresponding factor graph. The concepts of a complete P-partition and a complete P-line partition of order m are then defined for an arbitrary property P of a graph G. Two results are then obtained which answer the following questions for what properties P of a graph G does it follow that if G has complete P-partitions P-line partitions or orders m and n, then G has complete P-partitions P-line partitions of orders k for any k, m k n. Author

# Descriptors:

# Subject Categories:

- Theoretical Mathematics