Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor (Q6316420)
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: Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor |
scientific article |
Statements
29 March 2019
0 references
cs.DS
0 references
math.OC
0 references
