On the number of small cut in a graph (Q1847367)
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: On the number of small cut in a graph |
scientific article; zbMATH DE number 1835241
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the number of small cut in a graph |
scientific article; zbMATH DE number 1835241 |
Statements
On the number of small cut in a graph (English)
0 references
24 June 2003
0 references
undirected graph
0 references
0.93067193
0 references
0.92956865
0 references
0.92055684
0 references
0 references
0.90868115
0 references
0.9040024
0 references
