Graphs with no \(M\)-alternating paths between two vertices: an update (Q712278)
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 paths between two vertices: an update |
scientific article; zbMATH DE number 5807522
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graphs with no \(M\)-alternating paths between two vertices: an update |
scientific article; zbMATH DE number 5807522 |
Statements
Graphs with no \(M\)-alternating paths between two vertices: an update (English)
0 references
28 October 2010
0 references
necessary and sufficient condition
0 references
perfect matching
0 references
\(n\)-extendable graph
0 references
0.9545575
0 references
0.88818115
0 references
0.8686683
0 references
0.8678397
0 references
0.86119026
0 references
0.8597599
0 references
0.85515094
0 references
0.8545504
0 references
0.85451186
0 references
0.85451186
0 references
