Parameterized complexity of \textsc{maximum edge colorable subgraph}
type: Item
instance of: scholarly article
title: Parameterized complexity of \textsc{maximum edge colorable subgraph}
DOI: 10.1007/978-3-030-58150-3_50
author: Akanksha Agrawal
author: Madhumita Kundu
author: Abhishek Sahu
author: Saket Saurabh
author: Prafullkumar Tale
publication date: 2021-04-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/2008.07953
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336139
zbMATH Keywords: edge coloring
zbMATH Keywords: kernelization
zbMATH Keywords: FPT algorithms
zbMATH Keywords: kernel lower bound
MaRDI profile type: Publication
OpenAlex ID: W3082824253
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: The NP-Completeness of Edge-Coloring
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
description: scientific article; zbMATH DE number 7336139