Parameterized Complexity of Maximum Edge Colorable Subgraph
Crossref DOI link: https://doi.org/10.1007/s00453-022-01003-0
Published Online: 2022-07-14
Published Print: 2022-10
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Agrawal, Akanksha
Kundu, Madhumita
Sahu, Abhishek
Saurabh, Saket
Tale, Prafullkumar
Funding for this research was provided by:
European Research Council (819416)
Text and Data Mining valid from 2022-07-14
Version of Record valid from 2022-07-14
Article History
Received: 4 March 2021
Accepted: 1 July 2022
First Online: 14 July 2022