Pages that link to "Item:Q1277392"
From MaRDI portal
The following pages link to On the sum coloring problem on interval graphs (Q1277392):
Displaying 28 items.
- Minimum sum set coloring of trees and line graphs of trees (Q628310) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- On the minimum sum coloring of \(P_4\)-sparse graphs (Q742570) (← links)
- On sum coloring and sum multi-coloring for restricted families of graphs (Q764335) (← links)
- Time slot scheduling of compatible jobs (Q880586) (← links)
- Minimum sum edge colorings of multicycles (Q987666) (← links)
- Complexity results for minimum sum edge coloring (Q1028432) (← links)
- Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) (← links)
- On the cost-chromatic number of graphs (Q1363702) (← links)
- On chromatic sums and distributed resource allocation (Q1383159) (← links)
- Description and generation of all minimal colorings of an interval graph, and the solution of related problems. (Q1425893) (← links)
- On the performance guarantee of first fit for sum coloring (Q1628787) (← links)
- Batch coloring of graphs (Q1755745) (← links)
- Sum coloring and interval graphs: A tight upper bound for the minimum number of colors (Q1827686) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- On the interval chromatic number of proper interval graphs (Q2352054) (← links)
- Fragmented coloring of proper interval and split graphs (Q2355746) (← links)
- A short proof of the NP-completeness of minimum sum interval coloring (Q2488233) (← links)
- On the probabilistic minimum coloring and minimum \(k\)-coloring (Q2489951) (← links)
- A linear time approximation algorithm for interval coloring on proper interval graphs (Q2708486) (← links)
- Minimum sum coloring of \(P_{4}\)-sparse graphs (Q2840552) (← links)
- Batch Coloring of Graphs (Q2971156) (← links)
- Exact Algorithms for Intervalizing Colored Graphs (Q2999332) (← links)
- Chromatic Edge Strength of Some Multigraphs (Q3503528) (← links)
- Minimum Entropy Combinatorial Optimization Problems (Q3576040) (← links)
- Approximation Results for the Optimum Cost Chromatic Partition Problem (Q4943070) (← links)
- Complexity and online algorithms for minimum skyline coloring of intervals (Q5919565) (← links)
- Maximum cut on interval graphs of interval count four is NP-complete (Q6124829) (← links)
