2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings (Q1690578)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings |
scientific article; zbMATH DE number 6827835
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | 2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings |
scientific article; zbMATH DE number 6827835 |
Statements
2-connected factor-critical graphs \(G\) with exactly \(|E(G)| + 1\) maximum matchings (English)
0 references
19 January 2018
0 references
maximum matching
0 references
factor-critical graph
0 references
2-connected graph
0 references
