DID YOU KNOW? DTIC has over 3.5 million final reports on DoD funded research, development, test, and evaluation activities available to our registered users. Click
HERE to register or log in.
Accession Number:
ADA166562
Title:
Matching Extension and the Genus of a Graph,
Descriptive Note:
Corporate Author:
VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS
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
Distribution Statement:
APPROVED FOR PUBLIC RELEASE