Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We show that a factor-critical graph of order n has exactly n near-perfect matchings if and only if it is a connected graph whose… Expand
2011
2011
A graph is total domination edge-critical if the addition of any edge decreases the total domination number, while a graph with… Expand
2008
2008
  • G. Pap
  • Discret. Math.
  • 2008
  • Corpus ID: 16392861
We construct a combinatorial algorithm to find a maximum packing of fully node-disjoint non-returning A-paths. 
2007
2007
A graph G is said to be [email protected] if the size of any minimum dominating set of vertices is k, but if any edge is added to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
2004
2004
In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary… Expand
2004
2004
A graph G is said to be [email protected] if the size of any minimum dominating set of vertices is k, but if any edge is added to… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
2002
2002
Abstract A matching of a graph is a near-perfect matching if it covers all but one vertex. A connected graph G is said to be… Expand
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… Expand
1985
1985
The Edmonds—Gallai decomposition theorem for matchings of finite or locally finite graphs is generalized to matchings of the… Expand
1982
1982
We show that the Edmonds—Gallai decomposition theorem for matchings in finite graphs generalizes to all locally finite graphs.