Connected max cut is polynomial for graphs without the excluded minor $$K_5\backslash e$$
Crossref DOI link: https://doi.org/10.1007/s10878-020-00637-6
Published Online: 2020-08-10
Published Print: 2020-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Chaourar, Brahim http://orcid.org/0000-0002-0689-6747
Text and Data Mining valid from 2020-08-10
Version of Record valid from 2020-08-10
Article History
First Online: 10 August 2020
Compliance with ethical standards
:
: The author declare that his has no conflict of interest.