Pages that link to "Item:Q3480065"
From MaRDI portal
The following pages link to On the $1.1$ Edge-Coloring of Multigraphs (Q3480065):
Displayed 21 items.
- Improving a family of approximation algorithms to edge color multigraphs (Q293395) (← links)
- Approximating the chromatic index of multigraphs (Q630193) (← links)
- Inapproximability and approximability of minimal tree routing and coloring (Q935848) (← links)
- Graph edge colouring: Tashkinov trees and Goldberg's conjecture (Q968455) (← links)
- Combinatorial algorithms for data migration to minimize average completion time (Q1024212) (← links)
- Efficient algorithms for wavelength assignment on trees of rings (Q1028409) (← links)
- On Vizing's bound for the chromatic index of a multigraph (Q1044923) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Chromatic index determined by fractional chromatic index (Q1748268) (← links)
- A \(\frac{5}{2}\)-approximation algorithm for coloring rooted subtrees of a degree 3 tree (Q2185817) (← links)
- Structural properties of edge-chromatic critical multigraphs (Q2338635) (← links)
- Algorithms for data migration (Q2379927) (← links)
- Path multicoloring with fewer colors in spiders and caterpillars (Q2460919) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- From the quantum approximate optimization algorithm to a quantum alternating operator ansatz (Q2632506) (← links)
- Vizing's coloring algorithm and the fan number (Q3055930) (← links)
- On a theorem of Goldberg (Q3174233) (← links)
- Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
- A brief history of edge-colorings – with personal reminiscences (Q5862696) (← links)
- The complexity of path coloring and call scheduling (Q5941061) (← links)
- Efficiently list‐edge coloring multigraphs asymptotically optimally (Q6052475) (← links)