Matchings in Polytopal Graphs.
WASHINGTON UNIV SEATTLE DEPT OF MATHEMATICS
Pagination or Media Count:
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 barG, the largest possible number of edge-disjoint matchings of G. Theorem The largest value of pi barG, possible for 3-polytopal graphs G is 12. Author
- Theoretical Mathematics