Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:03642587n
Noun Concept
Categories: Graph families, Matching
EN
factor-critical graph  blossom
EN
In graph theory, a mathematical discipline, a factor-critical graph is a graph with n vertices in which every subgraph of n − 1 vertices has a perfect matching. Wikipedia
Definitions
Relations
Sources
EN
In graph theory, a mathematical discipline, a factor-critical graph is a graph with n vertices in which every subgraph of n − 1 vertices has a perfect matching. Wikipedia
IS A
graph
HAS KIND
friendship graph
STUDIED BY
graph theory
Wikipedia
EN
factor-critical graph
Wikidata
EN
Factor-critical graph
Wikipedia Redirections
EN
blossom (graph theory)

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License