Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (Q1028481): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import240304020342 (talk | contribs)
Set profile property.
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank

Revision as of 01:56, 5 March 2024

scientific article
Language Label Description Also known as
English
Weighted coloring on planar, bipartite and split graphs: Complexity and approximation
scientific article

    Statements

    Weighted coloring on planar, bipartite and split graphs: Complexity and approximation (English)
    0 references
    30 June 2009
    0 references
    graph coloring
    0 references
    weighted node coloring
    0 references
    weighted edge coloring
    0 references
    approximability
    0 references
    NP-completeness
    0 references
    planar graphs
    0 references
    bipartite graphs
    0 references
    split graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references