Parameterized Complexity of Maximum Edge Colorable Subgraph

Akanksha Agrawal, Madhumita Kundu, Abhishek Sahu +2

A graph $H$ is {\em $p$-edge colorable} if there is a coloring $\psi :E(H)\to \{1,2,\dots ,p\}$, such that for distinct $uv,vw\in E(H)$, we have $\psi (uv)\ne \psi (vw)$. The {\sc…