The minimum size of graphs satisfying cut conditions (Q1701098)
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: The minimum size of graphs satisfying cut conditions |
scientific article; zbMATH DE number 6842195
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The minimum size of graphs satisfying cut conditions |
scientific article; zbMATH DE number 6842195 |
Statements
The minimum size of graphs satisfying cut conditions (English)
0 references
22 February 2018
0 references
path-pairable graph
0 references
cut conditions
0 references
bisection
0 references
0.8484476804733276
0 references
0.7756754755973816
0 references
0.7551828622817993
0 references
0.7510805726051331
0 references
0.7333545684814453
0 references
