A characterization of extremal graphs with no matching-cut (Q3576676)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5763173
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A characterization of extremal graphs with no matching-cut |
scientific article; zbMATH DE number 5763173 |
Statements
30 July 2010
0 references
matching-cut
0 references
matching immune
0 references
extremal graphs
0 references
0.9218009114265442
0 references
0.7284109592437744
0 references
0.7214938402175903
0 references
0.7143709063529968
0 references
