Pages that link to "Item:Q608271"
From MaRDI portal
The following pages link to Approximating maximum edge 2-coloring in simple graphs (Q608271):
Displayed 4 items.
- Maximal \(k\)-edge-colorable subgraphs, Vizing's theorem, and Tuza's conjecture (Q526243) (← links)
- Online edge coloring of paths and trees with a fixed number of colors (Q1702302) (← links)
- Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings (Q2867103) (← links)
- Online Dual Edge Coloring of Paths and Trees (Q3453294) (← links)