The following pages link to Sum Multicoloring of Graphs (Q4521523):
Displaying 20 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Scheduling with conflicts: Online and offline algorithms (Q842559) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Dynamic programming based algorithms for set multicover and multiset multicover problems (Q974740) (← links)
- Coloring the Cartesian sum of graphs (Q998323) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Multicoloring trees. (Q1401922) (← links)
- Graph multi-coloring for a job scheduling application (Q1686066) (← links)
- Non-clairvoyant scheduling with conflicts for unit-size jobs (Q1721929) (← links)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs (Q1879365) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
- Minimum sum multicoloring on the edges of trees (Q2503344) (← links)
- Batch Coloring Flat Graphs and Thin (Q3512459) (← links)
- Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees (Q4538085) (← links)
- STACS 2004 (Q5309688) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311104) (← links)
- Approximation and Online Algorithms (Q5713450) (← links)
- Automata, Languages and Programming (Q5716832) (← links)
