On sum coloring and sum multi-coloring for restricted families of graphs (Q764335): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sur le coloriage des graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588432 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On chromatic sums and distributed resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum Color Sum of Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Zero knowledge and the chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof that `proper = unit' / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the sum coloring problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum Multicoloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411283 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4708601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Incremental) priority algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5708492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Roberts characterization of proper and unit interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved bounds for scheduling conflicting jobs with minsum criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models of greedy algorithms for graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Models for Unit Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elimination Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority algorithms for graph optimization problems / rank
 
Normal rank

Latest revision as of 23:28, 4 July 2024

scientific article
Language Label Description Also known as
English
On sum coloring and sum multi-coloring for restricted families of graphs
scientific article

    Statements

    On sum coloring and sum multi-coloring for restricted families of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    13 March 2012
    0 references
    sum coloring
    0 references
    sum multi-coloring
    0 references
    approximation algorithms
    0 references
    greedy algorithms
    0 references
    priority lower bound
    0 references
    graph algorithms
    0 references
    NP-hardness
    0 references
    geometric intersection graphs
    0 references
    clawfree graphs
    0 references
    unit disk graphs
    0 references
    interval graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references