On \(r\)-dynamic chromatic number of graphs (Q908316): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
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: On the dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic chromatic number of regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for the 2-hued chromatic number of graphs in terms of the independence number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(r\)-dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic coloring and list dynamic coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5466088 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hypergraph colouring and the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for transversals in graphs with bounded degree / rank
 
Normal rank

Revision as of 09:41, 11 July 2024

scientific article
Language Label Description Also known as
English
On \(r\)-dynamic chromatic number of graphs
scientific article

    Statements

    Identifiers