Dynamic chromatic number of regular graphs (Q713302): 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 list dynamic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2936711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful paths in vertex coloring 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: Rainbow paths with prescribed ends / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3503433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4074927 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2716030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conditional colorings of 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: Q3428629 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Even Cycle Problem for Directed Graphs / rank
 
Normal rank

Latest revision as of 20:09, 5 July 2024

scientific article
Language Label Description Also known as
English
Dynamic chromatic number of regular graphs
scientific article

    Statements

    Dynamic chromatic number of regular graphs (English)
    0 references
    0 references
    26 October 2012
    0 references
    dynamic chromatic number
    0 references
    2-colorability of hypergraphs
    0 references

    Identifiers