Pages that link to "Item:Q3439119"
From MaRDI portal
The following pages link to Coloring Graphs with Minimal Edge Load (Q3439119):
Displaying 11 items.
- Coloring a graph optimally with two colors (Q685594) (← links)
- Load balancing by graph coloring, an algorithm (Q1324417) (← links)
- Parsimonious edge coloring (Q1910535) (← links)
- Minimum number of palettes in edge colorings (Q2014713) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q2408202) (← links)
- On the minimum load coloring problem (Q2466019) (← links)
- Coloring \(k\)-colorable graphs using smaller palettes (Q2768312) (← links)
- Graphs with least number of colorings (Q4842706) (← links)
- Fast edge colorings with fixed number of colors to minimize imbalance (Q5301445) (← links)
- Parameterized and approximation algorithms for the load coloring problem (Q5363758) (← links)
- Fast Edge Colorings with Fixed Number of Colors to Minimize Imbalance (Q5385978) (← links)