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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2015.07.019 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W1501863447 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.6470 / 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: 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
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2015.07.019 / rank
 
Normal rank

Latest revision as of 08:10, 10 December 2024

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

    Statements

    Identifiers