A closure concept in factor-critical graphs

Research output: Contribution to journalArticlepeer-review

2 Citations (Scopus)


A graph G is called n-factor-critical if the removal of every set of n vertices results in a graph with a 1-factor. We prove the following theorem: Let G be a graph and let x be a locally n-connected vertex. Let {μ, v} be a pair of vertices in V(G) - {x} such that uv E(G), x ∈ NG(u) ∩ NG(v), and NG(x) ⊂ NG(u) ∪ NG(v) ∪ {u,v}. Then G is n-factor-critical if and only if G + uv is n-factor-critical.

Original languageEnglish
Pages (from-to)319-324
Number of pages6
JournalDiscrete Mathematics
Issue number1-3
Publication statusPublished - 2002 Dec 28


  • 1-Factors
  • Closures
  • Factor-critical graphs

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'A closure concept in factor-critical graphs'. Together they form a unique fingerprint.

Cite this