Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (Q830923)
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 7346741
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) |
scientific article; zbMATH DE number 7346741 |
Statements
Connected max cut is polynomial for graphs without the excluded minor \(K_5\backslash e\) (English)
0 references
10 May 2021
0 references
max cut
0 references
connected max cut
0 references
polynomial algorithm
0 references
min cut
0 references
graphs without the excluded minor \(K_5\backslash e\)
0 references
Hamilton cycle problem
0 references
0 references
0 references
0 references
0 references
0.7818329930305481
0 references
0.7746710777282715
0 references
0.7711093425750732
0 references
