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…

Papers overview

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

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…

2012

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

2011

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

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

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…

2008

2008

A connected graph G is said to be factor-critical if G − ν has a perfect matching for every vertex ν of G. In this paper, the…

2005

2004

In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary…

2000

A graph is h-matchable if G-X has a perfect matching for every subset X ~ V(G) with IXI = h, and it is h-extendable if every…