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

From MaRDI portal
Added link to MaRDI item.
RedirectionBot (talk | contribs)
Removed claims
Property / author
 
Property / author: Dominique de Werra / rank
Normal rank
 
Property / author
 
Property / author: Marc Demange / rank
Normal rank
 
Property / author
 
Property / author: Bruno Escoffier / rank
Normal rank
 
Property / author
 
Property / author: Jérôme Monnot / rank
Normal rank
 
Property / author
 
Property / author: Vangelis Th. Paschos / rank
Normal rank
 

Revision as of 07:15, 11 February 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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references