## Find a copy online

### Links to this item

## Find a copy in the library

Finding libraries that hold this item...

## Details

Material Type: | Internet resource |
---|---|

Document Type: | Internet Resource |

All Authors / Contributors: |
E Gyori; M D Plummer; VANDERBILT UNIV NASHVILLE TN DEPT OF MATHEMATICS. |

OCLC Number: | 227778857 |

Description: | 10 p. ; 23 x 29 cm. |

### Abstract:

Let us start with the definition of a kappa-extendable graph G. Suppose kappa is an integer such that 1 <or = kappa <or = (/V(G)/-2)/2. A graph G is kappa-extendable if G is connected, has a perfect matching (a 1- factor) and any matching in G consisting of kappa edges can be extended to (i.e., is a subset of) a perfect matching. The extendability number of G, extG, is the maximum kappa such that G is kappa-extendable. A natural problem is to determine the extendability number of a graph G.

## Reviews

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "The Cartesian Product of a k-Extendable and an l-Extendable Graph is (k + l +1)-Extendable.".
Be the first.