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.

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…

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

2004

2004

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

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

1982

We show that the Edmonds—Gallai decomposition theorem for matchings in finite graphs generalizes to all locally finite graphs.