Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor
From MaRDI portal
Publication:6316420
DOI10.1007/S10878-020-00637-6zbMath1467.90049arXiv1903.12641MaRDI QIDQ6316420
Publication date: 29 March 2019
This page was built for publication: Connected max cut is polynomial for graphs without $K_5\backslash e$ as a minor