Maximum Cuts in $$\mathscr {H}$$-Free Graphs
Crossref DOI link: https://doi.org/10.1007/s00373-020-02189-2
Published Online: 2020-05-23
Published Print: 2020-09
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Ma, Huawen http://orcid.org/0000-0002-6230-0821
Text and Data Mining valid from 2020-05-23
Version of Record valid from 2020-05-23
Article History
Received: 8 June 2019
Revised: 17 April 2020
First Online: 23 May 2020