On (g, f, n)-critical graphs

Jianxiang Li, Haruhide Matsuda

Research output: Contribution to journalArticlepeer-review

7 Citations (Scopus)


Let G be a graph, and let g and f be two integer-valued functions defined on V(G) such that g(x) ≤ f(x) for all x ∈ V(G). A graph G is called a (g, f, n)-critical graph if G - N has a (g, f)-factor for each N ⊆ V(G) with |N| = n. In this paper, a necessary and sufficient condition for a graph to be (g, f, n)-critical is given. Furthermore, the properties of (g, f, n)-critical graph are studied.

Original languageEnglish
Pages (from-to)71-82
Number of pages12
JournalArs Combinatoria
Publication statusPublished - 2006 Jan
Externally publishedYes


  • (g, f)-factor
  • Factor-critical graph

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'On (g, f, n)-critical graphs'. Together they form a unique fingerprint.

Cite this