Results on the Grundy chromatic number of graphs (Q856867): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Recognizing Greedy Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some perfect coloring properties of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the equality of the grundy and ochromatic numbers of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line 3-chromatic graphs. II: Critical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and first fit colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4208001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745272 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4243805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 25 pretty graph colouring problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Vertex Partitioning Problems on Partial k-Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge Dominating Sets in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4659607 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inequalities for the first-fit chromatic number / rank
 
Normal rank

Latest revision as of 10:36, 25 June 2024

scientific article
Language Label Description Also known as
English
Results on the Grundy chromatic number of graphs
scientific article

    Statements

    Results on the Grundy chromatic number of graphs (English)
    0 references
    0 references
    14 December 2006
    0 references
    polynomial time problem
    0 references
    NP-complete problem
    0 references
    Nordhaus-Gaddum-type inequalities
    0 references
    coloring
    0 references
    coNP-complete problem
    0 references

    Identifiers