Bounds on the dynamic chromatic number of a graph in terms of its chromatic number (Q1661495): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
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
16 August 2018
0 references
dynamic vertex coloring
0 references