Pages that link to "Item:Q4411281"
From MaRDI portal
The following pages link to Approximating maximum edge coloring in multigraphs (Q4411281):
Displaying 29 items.
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- Approximating maximum edge 2-coloring in simple graphs (Q608271) (← links)
- \((p,k)\)-coloring problems in line graphs (Q817821) (← links)
- An improved approximation algorithm for maximum edge 2-coloring in simple graphs (Q935838) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- Approximation algorithm for maximum edge coloring (Q1007243) (← links)
- Approximating maximum edge 2-coloring in simple graphs via local improvement (Q1035687) (← links)
- Approximating the maximum 3-edge-colorable subgraph problem (Q1043590) (← links)
- Minimum multiplicity edge coloring via orientation (Q1671364) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Parameterized complexity of \textsc{maximum edge colorable subgraph} (Q2019513) (← links)
- Parameterized complexity of maximum edge colorable subgraph (Q2088595) (← links)
- Characterization of saturated graphs related to pairs of disjoint matchings (Q2135642) (← links)
- On packing and coloring hyperedges in a cycle (Q2384398) (← links)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Using the minimum maximum flow degree to approximate the flow coloring problem (Q2675725) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Approximation and Hardness Results for the Maximum Edge q-coloring Problem (Q3060768) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
- On the Maximum Edge Coloring Problem (Q3602848) (← links)
- Optimal edge coloring of large graphs (Q4262695) (← links)
- Some maximum multigraphs and adge/vertex distance colourings (Q4846689) (← links)
- An asymptotic approximation scheme for multigraph edge coloring (Q4962714) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)
- Diverse Pairs of Matchings (Q6065425) (← links)
- Pairs of disjoint matchings and related classes of graphs (Q6117063) (← links)
- Diverse pairs of matchings (Q6547215) (← links)
- The maximum 2-edge-colorable subgraph problem and its fixed-parameter tractability (Q6616225) (← links)