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)

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

- Abdulkadir Celik, Redha M. Radaydeh, Fawaz S. Al-Qahtani, Ahmed H. Abd El-Malek, Mohamed-Slim Alouini
- 2017 IEEE Globecom Workshops (GC Wkshps)
- 2017

Being capable of serving multiple users with the same radio resource, non-orthogonal multiple access (NOMA) can provide desirable… (More)

Is this relevant?

2013

2013

- Ruohan Wang, Xiangyu Liu, Shulin Mou, Sai Xu, Zhixiang Zhang
- Trees
- 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)

Is this relevant?

2013

2013

- Marie-Laurence Mazure
- Journal of Approximation Theory
- 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

- Jean-François Remacle, François Henrotte, +4 authors Emilie Marchandise
- IMR
- 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)

Is this relevant?

2006

2005

2005

- Lionel M. Ni, Li Cui, Qiong Luo, Hoilun Ngan, Zeping Zhao
- 11th IEEE International Conference on Embedded…
- 2005

In March 2004, recognizing the importance of sensor networks, the Chinese Academy of Sciences and the Hong Kong University of… (More)

Is this relevant?

2004

2001

2001

- Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito
- Discrete Mathematics
- 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

- Odile Favaron, Minyong Shi
- Australasian J. Combinatorics
- 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

- Silvio Micali, Vijay V. Vazirani
- 21st Annual Symposium on Foundations of Computer…
- 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?