On the sum coloring problem on interval graphs
From MaRDI portal
Publication:1277392
DOI10.1007/PL00009252zbMath0913.68156OpenAlexW2068849088MaRDI QIDQ1277392
Publication date: 2 February 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/pl00009252
Related Items
On the performance guarantee of first fit for sum coloring ⋮ On the cost-chromatic number of graphs ⋮ On chromatic sums and distributed resource allocation ⋮ Time slot scheduling of compatible jobs ⋮ Chromatic Edge Strength of Some Multigraphs ⋮ Maximum cut on interval graphs of interval count four is NP-complete ⋮ Minimum sum set coloring of trees and line graphs of trees ⋮ Batch Coloring of Graphs ⋮ Batch coloring of graphs ⋮ Minimum Entropy Combinatorial Optimization Problems ⋮ Minimum entropy combinatorial optimization problems ⋮ On the probabilistic minimum coloring and minimum \(k\)-coloring ⋮ Minimum sum edge colorings of multicycles ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ On the minimum sum coloring of \(P_4\)-sparse graphs ⋮ Complexity results for minimum sum edge coloring ⋮ On sum coloring and sum multi-coloring for restricted families of graphs ⋮ Weighted sum coloring in batch scheduling of conflicting jobs ⋮ Sum coloring and interval graphs: A tight upper bound for the minimum number of colors ⋮ Minimum Sum Coloring of P4-sparse graphs
