Parameterized complexity of \textsc{maximum edge colorable subgraph}
From MaRDI portal
Publication:2019513
Recommendations
- Parameterized complexity of maximum edge colorable subgraph
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
- Approximating the maximum 2- and 3-edge-colorable subgraph problems
- On the parameterized complexity of the maximum edge 2-coloring problem
- The parameterized complexity of the rainbow subgraph problem
Cites work
- Classifying \(k\)-edge colouring for \(H\)-free graphs
- Color-coding
- Graph edge coloring: a survey
- scientific article; zbMATH DE number 1947051 (Why is no real title available?)
- scientific article; zbMATH DE number 7759294 (Why is no real title available?)
- Improved Parameterized Upper Bounds for Vertex Cover
- Improved upper bounds for vertex cover
- Integer Programming with a Fixed Number of Variables
- Kernelization. Theory of parameterized preprocessing
- Minkowski's Convex Body Theorem and Integer Programming
- NP completeness of finding the chromatic index of regular graphs
- Parameterized algorithms
- Randomized divide-and-conquer: improved path, matching, and packing algorithms
- The NP-Completeness of Edge-Coloring
Cited in
(6)- Parameterized complexity of maximum edge colorable subgraph
- Characterization of saturated graphs related to pairs of disjoint matchings
- Parameterized Algorithms for Max Colorable Induced Subgraph Problem on Perfect Graphs
- Maximum -edge-colorable subgraphs of class II graphs
- Pairs of disjoint matchings and related classes of graphs
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability
This page was built for publication: Parameterized complexity of \textsc{maximum edge colorable subgraph}
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2019513)
