Pages that link to "Item:Q1043590"
From MaRDI portal
The following pages link to Approximating the maximum 3-edge-colorable subgraph problem (Q1043590):
Displayed 4 items.
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Maximum Δ-edge-colorable subgraphs of class II graphs (Q2911495) (← links)