Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

20 relations
Bridge (graph theory)Claw-free graphComplement graphCritical graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2020
2020
Ear-Slicing for Matchings in Hypergraphs
We study when a given edge of a factor-critical graph is contained in a matching avoiding exactly one, pregiven vertex of the… 
2019
2019
Ear-Slicing for Matchings in Hypergraphs
We study when a given edge of a factor-critical graph is contained in a matching avoiding exactly one, pregiven vertex of the… 
2013
2013
2-connected equimatchable graphs on surfaces
A graph $G$ is equimatchable if any matching in $G$ is a subset of a maximum-size matching. It is known that any $2$-connected… 
2012
2012
On Cartesian Product of Factor-Critical Graphs
A graph G is k-factor-critical if G − S has a perfect matching for any k-subset S of V(G). In this paper, we investigate the… 
2005
2005
A note on the degree prescribed factor problem Jácint Szabó
  • 2005
  • Corpus ID: 13827445
The degree prescribed factor problem is to decide if a graph has a subgraph satisfying given degree prescriptions at each vertex… 
2004
2004
Characterizing factor critical graphs and an algorithm
In this paper, we show a necessary and sufficient condition which characterizes all factor critical graphs. Using this necessary… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)