Bounds on the dynamic chromatic number of a graph in terms of its chromatic number (Q1661495): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10958-018-3855-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2804029448 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the list dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3001393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On proper colorings of hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analog of Brooks' theorem for dynamic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the difference between chromatic number and dynamic chromatic number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic coloring and list dynamic coloring of planar graphs / rank
 
Normal rank

Latest revision as of 08:58, 16 July 2024

scientific article
Language Label Description Also known as
English
Bounds on the dynamic chromatic number of a graph in terms of its chromatic number
scientific article

    Statements

    Bounds on the dynamic chromatic number of a graph in terms of its chromatic number (English)
    0 references
    0 references
    16 August 2018
    0 references
    dynamic vertex coloring
    0 references

    Identifiers