Nonrepetitive colorings of graphs (Q5899395): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.endm.2007.01.063 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4230526004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring with no 2-colored \(P_4\)'s / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking the rhythm on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2784326 / 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: Q3070298 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Map-Coloring Game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoidable patterns in strings of symbols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonrepetitive colorings of trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5475511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which graphs allow infinite nonrepetitive walks? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Problems in Pattern Avoidance / 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: Non-repetitive tilings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fixing block method in combinatorics on words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thue-like sequences and rainbow arithmetic progressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424780 / 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: Non-repetitive colorings of infinite sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orderings on graphs and game coloring number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3659988 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree-depth, subgraph coloring and homomorphism bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank

Revision as of 19:12, 25 June 2024

scientific article; zbMATH DE number 5158438
Language Label Description Also known as
English
Nonrepetitive colorings of graphs
scientific article; zbMATH DE number 5158438

    Statements

    Nonrepetitive colorings of graphs (English)
    0 references
    0 references
    0 references
    29 May 2007
    0 references
    nonrepetitive coloring
    0 references
    thue sequences
    0 references
    list coloring
    0 references
    game coloring number
    0 references

    Identifiers