Parameterized complexity of maximum edge colorable subgraph
From MaRDI portal
Publication:2088595
DOI10.1007/s00453-022-01003-0WikidataQ114229325 ScholiaQ114229325MaRDI QIDQ2088595
Saket Saurabh, Abhishek Sahu, Prafullkumar Tale, Akanksha Agrawal, Madhumita Kundu
Publication date: 6 October 2022
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-022-01003-0
68R10: Graph theory (including graph drawing) in computer science
68Q27: Parameterized complexity, tractability and kernelization