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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1980-2017
024619802017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Being capable of serving multiple users with the same radio resource, non-orthogonal multiple access (NOMA) can provide desirable… (More)
  • figure 1
  • figure 2
  • figure 3
  • table I
  • figure 4
Is this relevant?
2013
2013
The gynoecium in M. denudata was thermogenic, and the first peak in the female phase lasted longer than the second peak in the… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
By piecewise Chebyshevian splines we mean splines with sections in different Extended Chebyshev spaces of the same dimension… (More)
Is this relevant?
2011
2011
In a recent paper [1], a new indirect method to generate all-quad meshes has been developed. It takes advantage of a well known… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
In March 2004, recognizing the importance of sensor networks, the Chinese Academy of Sciences and the Hong Kong University of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2004
2004
 
Is this relevant?
2001
2001
A graph G is said to be n-factor-critical if G − S has a 1-factor for any S ⊂V (G) with |S| = n. In this paper, we prove that if… (More)
Is this relevant?
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… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In this paper we present an 0(√|V|¿|E|) algorithm for finding a maximum matching in general graphs. This algorithm works in… (More)
Is this relevant?