On the public citation graph
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
0 signed · 76 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0012-365x(91)90134-nopenalex-snapshot
Which graphs allow infinite nonrepetitive walks?
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0576867-5openalex-snapshot
Binary Sequences which Contain no BBb
inferredcites →https://doi.org/10.11575/prism/17416openalex-snapshot
Non-repetitive walks in graphs and digraphs
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
inferredcites →https://doi.org/10.2307/2371431openalex-snapshot
Symbolic Dynamics II. Sturmian Trajectories
inferredcites →https://doi.org/10.46298/dmtcs.3415openalex-snapshot
Nonrepetitive colorings of graphs
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/jcd.21677openalex-snapshot
Nonsymmetric 2‐(v,k,λ) designs, with (r,λ) = 1, admitting a solvable flag‐transitive automorphism group of affine type
inferred← citeshttps://doi.org/10.1002/jgt.20488openalex-snapshot
Facial non-repetitive edge-coloring of plane graphs
inferred← citeshttps://doi.org/10.1002/jgt.21695openalex-snapshot
Facial Nonrepetitive Vertex Coloring of Plane Graphs
inferred← citeshttps://doi.org/10.1002/rsa.20347openalex-snapshot
Nonrepetitive list colourings of paths
inferred← citeshttps://doi.org/10.1007/11779148_22openalex-snapshot
Closure of Language Classes Under Bounded Duplication
inferred← citeshttps://doi.org/10.1007/3-540-45005-x_28openalex-snapshot
Circular Words Avoiding Patterns
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_10openalex-snapshot
Circularly Squarefree Words and Unbordered Conjugates: A New Approach
inferred← citeshttps://doi.org/10.1007/978-3-319-67428-5_3openalex-snapshot
Distinct Squares in Circular Words
inferred← citeshttps://doi.org/10.1007/978-3-642-14455-4_37openalex-snapshot
On the Existence of Minimal β-Powers
inferred← citeshttps://doi.org/10.1007/978-3-642-21518-6_20openalex-snapshot
Determining Parameters of Key Predistribution Schemes via Linear Codes in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-39310-5_18openalex-snapshot
Shortest Repetition-Free Words Accepted by Automata
inferred← citeshttps://doi.org/10.1007/978-3-7643-7400-6_16openalex-snapshot
Nonrepetitive Graph Coloring
inferred← citeshttps://doi.org/10.1007/s00224-008-9147-5openalex-snapshot
Border Correlations of Partial Words
inferred← citeshttps://doi.org/10.1007/s00236-003-0110-2openalex-snapshot
A word on 7 letters which is non-repetitive up to mod 5
inferred← citeshttps://doi.org/10.1007/s00373-015-1642-2openalex-snapshot
On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method
inferred← citeshttps://doi.org/10.1007/s00373-017-1816-1openalex-snapshot
New Bounds for Facial Nonrepetitive Colouring
inferred← citeshttps://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
inferred← citeshttps://doi.org/10.1007/s10623-016-0297-1openalex-snapshot
Cyclic subspace codes via subspace polynomials
inferred← citeshttps://doi.org/10.1007/s40879-014-0016-2openalex-snapshot
Total Thue colourings of graphs
inferred← citeshttps://doi.org/10.1016/j.aam.2020.102095openalex-snapshot
Avoiding abelian powers cyclically
inferred← citeshttps://doi.org/10.1016/j.dam.2015.06.026openalex-snapshot
Fractional Thue chromatic number of graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2017.06.018openalex-snapshot
Facial anagram-free edge-coloring of plane graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.017openalex-snapshot
Nonrepetitive colorings of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2006.09.019openalex-snapshot
Some results in square-free and strong square-free edge-colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.07.063openalex-snapshot
Breaking the rhythm on graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2007.08.039openalex-snapshot
Thue type problems for graphs, points, and numbers
inferred← citeshttps://doi.org/10.1016/j.disc.2011.09.027openalex-snapshot
Nonrepetitive vertex colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2012.01.023openalex-snapshot
On the facial Thue choice index of plane graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2016.07.026openalex-snapshot
Facially-constrained colorings of plane graphs: A survey
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114828openalex-snapshot
The nonrepetitive coloring of grids
inferred← citeshttps://doi.org/10.1016/j.endm.2005.06.077openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.endm.2007.01.063openalex-snapshot
Nonrepetitive colorings of graphs
inferred← citeshttps://doi.org/10.1016/j.ipl.2010.05.005openalex-snapshot
Cyclically repetition-free words on small alphabets
inferred← citeshttps://doi.org/10.1016/j.tcs.2004.12.024openalex-snapshot
The Thue–Morse word contains circular 5/2+ power free words of every length
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.004openalex-snapshot
Pattern avoidance: themes and variations
inferred← citeshttps://doi.org/10.1051/ita/2020006openalex-snapshot
The weak circular repetition threshold over large alphabets
inferred← citeshttps://doi.org/10.1109/tit.2008.921692openalex-snapshot
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes
inferred← citeshttps://doi.org/10.1142/s0129054111008969openalex-snapshot
ON THE EXISTENCE OF MINIMAL β-POWERS
inferred← citeshttps://doi.org/10.1142/s0219265919400036openalex-snapshot
Facial Colorings of Plane Graphs
inferred← citeshttps://doi.org/10.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
inferred← citeshttps://doi.org/10.1556/sscmath.2007.1029openalex-snapshot
On square-free vertex colorings of graphs
inferred← citeshttps://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferred← citeshttps://doi.org/10.2139/ssrn.5253184openalex-snapshot
New Lower Bounds on the Non-Repetitive Chromatic Number of Some Graphs
inferred← citeshttps://doi.org/10.21954/ou.ro.00005deeopenalex-snapshot
Combinatorial aspects of root lattices and words
inferred← citeshttps://doi.org/10.22215/etd/2015-10989openalex-snapshot
Facial Nonrepetitive Graph Colourings
inferred← citeshttps://doi.org/10.3390/e10040590openalex-snapshot
On the Entropy and Letter Frequencies of Powerfree Words
inferred← citeshttps://doi.org/10.36045/bbms/1133793340openalex-snapshot
Attainable lengths for circular binary words avoiding $k$ powers
inferred← citeshttps://doi.org/10.37236/1763openalex-snapshot
There Exist Binary Circular $5/2^+$ Power Free Words of Every Length
inferred← citeshttps://doi.org/10.37236/1767openalex-snapshot
On the Entropy and Letter Frequencies of Ternary Square-Free Words
inferred← citeshttps://doi.org/10.37236/253openalex-snapshot
Non-Repetitive 3-Coloring of Subdivided Graphs
inferred← citeshttps://doi.org/10.37236/3153openalex-snapshot
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
inferred← citeshttps://doi.org/10.37236/7985openalex-snapshot
Circular Repetition Thresholds on Some Small Alphabets: Last Cases of Gorbunova's Conjecture
inferred← citeshttps://doi.org/10.37236/916openalex-snapshot
Bordered Conjugates of Words over Large Alphabets
inferred← citeshttps://doi.org/10.48550/arxiv.1309.3164openalex-snapshot
Total Thue colourings of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1601.02914openalex-snapshot
On New Thue Colouring Concepts of Certain Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1702.01058openalex-snapshot
On repetition thresholds of caterpillars and trees of bounded degree
inferred← citeshttps://doi.org/10.48550/arxiv.2001.11763openalex-snapshot
Lengths of extremal square-free ternary words
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.