On 1-factors and matching extension

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We prove the following: (1) Let G be a graph with a 1-factor and let F be an arbitrary 1-factor of G. If G \ {a,b} is k-extendable for each ab ∈ F, then G is k-extendable. (2) Let G be a graph and let M be an arbitrary maximal matching of G. If G \ {a, b} is k-factor-critical for each ab ∈ M, then G is k-factor-critical.

Original languageEnglish
Pages (from-to)285-290
Number of pages6
JournalDiscrete Mathematics
Volume222
Issue number1-3
DOIs
Publication statusPublished - 2000 Jul 28

Keywords

  • 1-factor
  • Matching
  • k-extendable
  • k-factor-critical

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'On 1-factors and matching extension'. Together they form a unique fingerprint.

  • Cite this