Skip to search formSkip to main contentSkip to account menuSemantic Scholar Semantic Scholar's Logo Search 221,475,243 papers from all fields of science

Search

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

2015

2015

A connected graph $$G$$G is said to be factor-critical if $$G-v$$G-v has a perfect matching for every vertex $$v$$v of $$G$$G…

2014

2014

A graph of order n is said to be k-factor-critical for non-negative integer k <= n if the removal of any k vertices results in a…

2011

2011

A graph is total domination edge-critical if the addition of any edge decreases the total domination number, while a graph with…

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…

2009

2009

A vertex subset S of a graph G = (V,E) is a total dominating set if every vertex of G is adjacent to some vertex in S. The total…

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