Accession Number:

ADA166562

Title:

Matching Extension and the Genus of a Graph,

Descriptive Note:

Corporate Author:

VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS

Personal Author(s):

• Plummer, Michael D.

Report Date:

1986-03-01

Pagination or Media Count:

38.0

Abstract:

Let G be a graph with p points having a perfect matching and suppose n is a positive integer with n or p-22. Then G is n-extendable if every matching in G containing n lines is a subset of a perfect matching. In this paper we obtain an upper bound on the n-extendability of a graph in terms of its genus. Keywords Euler contributions Theorems. Author

Descriptors:

• *GRAPHS
• *MATCHING
• NUMBERS
• THEOREMS
• POINTS(MATHEMATICS)

Subject Categories:

• Theoretical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE