Pages that link to "Item:Q967422"
From MaRDI portal
The following pages link to Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422):
Displaying 19 items.
- Approximate Max \(k\)-Cut with subgraph guarantee (Q293220) (← links)
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
- Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- On maximum \(k\)-edge-colorable subgraphs of bipartite graphs (Q1730239) (← links)
- An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem (Q1944924) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Maximum \(\Delta \)-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)
- Improved Inapproximability Results for Maximum k-Colorable Subgraph (Q3638876) (← links)
- ON 4-EDGE COLORING OF CUBIC GRAPHS CONTAINING “SMALL” NON-PLANAR SUBGRAPHS (Q4639461) (← links)
- An approximation algorithm for covering vertices by \(4^+\)-paths (Q6606209) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)
