Parameterized complexity of maximum edge colorable subgraph
type: Item
instance of: scholarly article
title: Parameterized complexity of maximum edge colorable subgraph
author: Akanksha Agrawal
author: Madhumita Kundu
author: Abhishek Sahu
author: Saket Saurabh
author: Prafullkumar Tale
published in: Algorithmica
publication date: 2022-10-06T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 7596613
zbMATH Keywords: edge coloring
zbMATH Keywords: kernelization
zbMATH Keywords: FPT algorithms
zbMATH Keywords: kernel lower bound
Wikidata QID: Q114229325
MaRDI profile type: Publication
full work available at URL: s00453-022-01003-0
OpenAlex ID: W3075687921
cites work: Paths to Trees and Cacti
cites work: Color-coding
cites work: Graph edge coloring: a survey
cites work: Improved Parameterized Upper Bounds for Vertex Cover
cites work: Improved upper bounds for vertex cover
cites work: Randomized Divide-and-Conquer: Improved Path, Matching, and Packing Algorithms
cites work: Parameterized Algorithms
cites work: Q4411281
cites work: Kernelization
cites work: Classifying \(k\)-edge colouring for \(H\)-free graphs
cites work: Q6059192
cites work: Parameterized algorithms and kernels for rainbow matching
cites work: The NP-Completeness of Edge-Coloring
cites work: Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT
cites work: Minkowski's Convex Body Theorem and Integer Programming
cites work: Integer Programming with a Fixed Number of Variables
cites work: NP completeness of finding the chromatic index of regular graphs
cites work: Q4231923
DOI: 10.1007/S00453-022-01003-0
Recommended article: Parameterized complexity of \textsc{maximum edge colorable subgraph}
Recommended article: On the Parameterized Complexity of the Maximum Edge 2-Coloring Problem
Recommended article: Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
Recommended article: Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
Recommended article: Parameterized complexity of vertex colouring
Recommended article: Approximating the maximum 2- and 3-edge-colorable subgraph problems
Recommended article: On the Complexity of the Max-Edge-Coloring Problem with Its Variants
Recommended article: The Maximum k-Colorable Subgraph Problem and Related Problems
Recommended article: Approximating the maximum 3-edge-colorable subgraph problem
Recommended article: Q4448755
description: scientific article; zbMATH DE number 7596613