@article{Mkrtchyan_2024, title={The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability}, volume={28}, url={https://jgaa.info/index.php/jgaa/article/view/2931}, DOI={10.7155/jgaa.v28i1.2931}, abstractNote={<pre>A $k$-edge-coloring of a graph is an assignment of colors $\{1,...,k\}$ to edges of the graph such that adjacent edges receive different colors. <br>In the maximum $k$-edge-colorable subgraph problem we are given a graph and an integer $k$, the goal is to find a $k$-edge-colorable subgraph with maximum number of edges together with its $k$-edge-coloring. <br>In this paper, we consider the maximum 2-edge-colorable subgraph problem and present some results that deal with the fixed-parameter tractability of this problem.</pre>}, number={1}, journal={Journal of Graph Algorithms and Applications}, author={Mkrtchyan, Vahan}, year={2024}, month={May}, pages={129–147} }