Max-cut and extendability of matchings in distance-regular graphs (Q518196): Difference between revisions
From MaRDI portal
Latest revision as of 20:13, 9 December 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Max-cut and extendability of matchings in distance-regular graphs |
scientific article |
Statements
Max-cut and extendability of matchings in distance-regular graphs (English)
0 references
28 March 2017
0 references
\(t\)-extendable connected graph
0 references
0 references
0 references