A Lower Bound of the cd-Chromatic Number and Its Complexity (Q2971664): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithmic Aspects of Dominator Colorings in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of graph coloring - its types, methods and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3429518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of approximating \(k\)-set packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Algorithms for Class Domination Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dominator colorings in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4770411 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cd-Coloring of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4982508 / rank
 
Normal rank

Latest revision as of 15:23, 13 July 2024

scientific article
Language Label Description Also known as
English
A Lower Bound of the cd-Chromatic Number and Its Complexity
scientific article

    Statements

    Identifiers

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