Preferred language:

This is the default search language used by BabelNet
Select the main languages you wish to use in BabelNet:
Selected languages will be available in the dropdown menus and in BabelNet entries

### Z

all preferred languages
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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

•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
• 图论
HAS KIND
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12     •     Categories: Graph families, Matching

# Factor-critical graph · Blossom (graph theory)

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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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

•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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

•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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
•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12     •     Categories: Семейства графов

# Фактор-критический граф · почти сочетаемый граф

Фактор-критический граф — это граф с n вершинами, в котором каждый подграф с n − 1 вершинами имеет совершенное паросочетание. Wikipedia

## More definitions

Граф с n вершинами, в котором каждый подграф с n − 1 вершинами имеет совершенное паросочетание Wikidata

•     bn:03642587n     •     NOUN     •     Concept    •     Updated on 2019/02/12

# No term available 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

## Translations

factor-critical graph, blossom
фактор-критический граф, почти сочетаемый граф

## Sources

### Wikidata items

3 sources | 3 senses
2 sources | 3 senses

factor-critical