Accession Number:

ADA234392

Title:

Extending Matchings in Graphs: A Survey

Descriptive Note:

Corporate Author:

VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS

Personal Author(s):

Report Date:

1990-01-01

Pagination or Media Count:

17.0

Abstract:

This paper surveys a variety of results obtained over the past few years concerning n-extendable graphs. In particular, we will describe how the property of n-extendability interacts with such other graph parameters as genus, toughness, claw-freedom and degree sums and generalized neighborhood conditions. We will also investigate the behavior of matching extendability under the operation of Cartesian product. The study of n-extendability for planar graphs has been-and continues to be-of particular interest.

Subject Categories:

  • Numerical Mathematics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE