On approximating the b-chromatic number (Q1765381): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: The b-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some bounds for the \(b\)-chromatic number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414507 / rank
 
Normal rank

Latest revision as of 18:49, 7 June 2024

scientific article
Language Label Description Also known as
English
On approximating the b-chromatic number
scientific article

    Statements

    On approximating the b-chromatic number (English)
    0 references
    0 references
    0 references
    0 references
    23 February 2005
    0 references
    0 references
    Combinatorial problems
    0 references
    Approximation algorithms
    0 references
    Graph coloring
    0 references
    0 references
    0 references