Storming Media: Pentagon Reports and DocumentsPentagon Reports: Fast. Definitive. Complete.     
New Account »
Forgot Password?
Advanced Search »
Math and StatisticsNumerical Mathematics

Extending Matchings in Graphs: A Survey

Authors: Michael D. Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS
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.

Limitations: APPROVED FOR PUBLIC RELEASE
Pages: 17
Report Date: 90
Contract Number: N00014-85-K-0488
Report Number: A293432
Keywords relating to this report:
CARTESIAN COORDINATES
GRAPHS
OPERATION
PAPER
PARAMETERS
PLANAR STRUCTURES
SURVEYS
TOUGHNESS
Email This Abstract