Complete Complexity Dichotomy for $$\boldsymbol 7 $$-Edge Forbidden Subgraphs in the Edge Coloring Problem
Crossref DOI link: https://doi.org/10.1134/S1990478920040092
Published Online: 2021-01-29
Published Print: 2020-11
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Malyshev, D. S.
Text and Data Mining valid from 2020-11-01
Version of Record valid from 2020-11-01
Article History
Received: 22 January 2020
Revised: 1 June 2020
Accepted: 11 June 2020
First Online: 29 January 2021