Repetition thresholds for subdivided graphs and trees (Q2911431): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2052807252 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: There exist binary circular \(5/2^+\) power free words of every length / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dejean's conjecture and letter frequency / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sur un théorème de Thue / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonrepetitive colorings of graphs -- a survey / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A generator of morphisms for infinite words / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-repetitive 3-coloring of subdivided graphs / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:42, 5 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Repetition thresholds for subdivided graphs and trees |
scientific article |
Statements
Repetition thresholds for subdivided graphs and trees (English)
0 references
31 August 2012
0 references
combinatorics on words
0 references
repetition threshold
0 references
square-free coloring
0 references