Pages that link to "Item:Q1043590"
From MaRDI portal
The following pages link to Approximating the maximum 3-edge-colorable subgraph problem (Q1043590):
Displayed 8 items.
- Parameterized and approximation algorithms for finding two disjoint matchings (Q300238) (← links)
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Approximating the maximum 2- and 3-edge-colorable subgraph problems (Q967422) (← links)
- On parsimonious edge-colouring of graphs with maximum degree three (Q2376086) (← links)
- On disjoint matchings in cubic graphs: maximum 2-edge-colorable and maximum 3-edge-colorable subgraphs (Q2449123) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Maximum Δ-edge-colorable subgraphs of class II graphs (Q2911495) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)