Skip to search formSkip to main contentSkip to account menu

Factor-critical graph

Known as: Blossom (graph theory) 
In graph theory, a mathematical discipline, a factor-critical graph (or hypomatchable graph) is a graph with n vertices in which every subgraph of n… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
A vertex subset S of a graph G = (V, E) is a double dominating set for G if |N[v]∩S| ≥ 2 for each vertex v ∈ V, where N[v] = {u… 
2008
2008
  • G. Pap
  • Discret. Math.
  • 2008
  • Corpus ID: 16392861
2004
2004
In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary… 
1998
1998
A graph G of order n is k-factor-critical, where k is an integer of the same parity as n with 0 ::; k ::; n, if G X has a perfect… 
1992
1985
1985
The Edmonds—Gallai decomposition theorem for matchings of finite or locally finite graphs is generalized to matchings of the… 
1982
1982
We show that the Edmonds—Gallai decomposition theorem for matchings in finite graphs generalizes to all locally finite graphs.