Graphs with no \(M\)-alternating path between two vertices (Q1827684)
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: Graphs with no M-alternating path between two vertices |
scientific article; zbMATH DE number 2083649
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graphs with no \(M\)-alternating path between two vertices |
scientific article; zbMATH DE number 2083649 |
Statements
Graphs with no \(M\)-alternating path between two vertices (English)
0 references
6 August 2004
0 references
\(M\)-alternating path
0 references
Perfect matching
0 references
\(n\)-Extendable graphs
0 references
0.8030737042427063
0 references
0.8028868436813354
0 references
0.774614691734314
0 references
0.7703604698181152
0 references
