DeepAI AI Chat
Log In Sign Up

On the fixed-parameter tractability of the maximum 2-edge-colorable subgraph problem

by   Alessandro Aloisio, et al.
Università degli Studi dell'Aquila

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. 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. 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.


page 1

page 2

page 3

page 4


On maximum k-edge-colorable subgraphs of bipartite graphs

If k≥ 0, then a k-edge-coloring of a graph G is an assignment of colors ...

A new proof on the Ramsey number of matchings

For given simple graphs H_1,H_2,...,H_c, the Ramsey number r(H_1,H_2,......

Parameterized Complexity of Maximum Edge Colorable Subgraph

A graph H is p-edge colorable if there is a coloring ψ: E(H) →{1,2,…,p},...

Set-coloring Ramsey numbers and error-correcting codes near the zero-rate threshold

For positive integers n,r,s with r > s, the set-coloring Ramsey number R...

A Global Approach for Solving Edge-Matching Puzzles

We consider apictorial edge-matching puzzles, in which the goal is to ar...

Computing Sparse Jacobians and Hessians Using Algorithmic Differentiation

Stochastic scientific models and machine learning optimization estimator...

Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs

Given an undirected graph G and integers c and k, the Maximum Edge-Color...