Extending Matchings in Graphs: A Survey

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.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1990
Accession Number
ADA234392

Entities

People

  • Michael D. Plummer

Organizations

  • Vanderbilt University

Tags

Communities of Interest

  • Air Platforms

DTIC Thesaurus Topics

  • Algorithms
  • Cells
  • Construction
  • Decomposition
  • Determinants (Mathematics)
  • Embedding
  • Families (Human)
  • Graph Theory
  • Lepidoptera
  • Materials
  • Mathematics
  • New York
  • Orientation (Direction)
  • Polynomials
  • Toughness
  • Triangles

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design