Nonrepetitive list colourings of paths (Q3068765): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: On square-free vertex colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: There are ternary circular square-free words of length \(n\) for \(n \geq\) 18 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pattern avoidance: themes and variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue choosability of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs -- a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue type problems for graphs, points, and numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly nonrepetitive sequences: Winning strategies from the local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-repetitive 3-coloring of subdivided graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank

Latest revision as of 16:39, 3 July 2024

scientific article
Language Label Description Also known as
English
Nonrepetitive list colourings of paths
scientific article

    Statements