
Accession Number : AD0759039
Title : Matchings in Polytopal Graphs.
Descriptive Note : Technical rept.,
Corporate Author : WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Personal Author(s) : Grunbaum,Branko
Report Date : MAR 1973
Pagination or Media Count : 25
Abstract : A matching M of a graph G is a set of edges of G such that each vertex of G is incident with a most one edge of M, and that no edge of G may be added to M without violating this restriction. A number of new results on matchings are obtained, in particular concerning planar and polytopal graphs. A typical result is the following one which deals with (pi bar)(G), the largest possible number of edgedisjoint matchings of G. Theorem: The largest value of (pi bar)(G), possible for 3polytopal graphs G is 12. (Author)
Descriptors : (*GRAPHICS, THEOREMS), SET THEORY, TOPOLOGY, INEQUALITIES, TRIANGULATION
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE