The following pages link to (Q4411281):
Displayed 9 items.
- 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)
- Packing \([1, \Delta ]\)-factors in graphs of small degree (Q2460103) (← links)
- Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)