Unifying maximum cut and minimum cut of a planar graph (Q5375441)
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: Unifying maximum cut and minimum cut of a planar graph |
scientific article; zbMATH DE number 6937030
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Unifying maximum cut and minimum cut of a planar graph |
scientific article; zbMATH DE number 6937030 |
Statements
Unifying maximum cut and minimum cut of a planar graph (English)
0 references
14 September 2018
0 references
