On the public citation graph
On Ternary Square-Free Circular Words
0 signed · 24 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.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
inferredcites →https://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
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-030-85088-3_12openalex-snapshot
Counting Ternary Square-Free Words Quickly
inferred← citeshttps://doi.org/10.1007/978-3-319-23660-5_19openalex-snapshot
On the Tree of Ternary Square-Free Words
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-32589-2_65openalex-snapshot
Constructing Premaximal Ternary Square-Free Words of Any Level
inferred← citeshttps://doi.org/10.1007/978-3-662-53132-7_15openalex-snapshot
Ternary Square-Free Partial Words with Many Wildcards
inferred← citeshttps://doi.org/10.1016/j.disc.2015.10.043openalex-snapshot
On periodic properties of circular words
inferred← citeshttps://doi.org/10.1016/j.tcs.2018.09.010openalex-snapshot
Subword complexity and power avoidance
inferred← citeshttps://doi.org/10.1016/j.tcs.2020.10.029openalex-snapshot
Characterization of the lengths of binary circular words containing no squares other than 00, 11, and 0101
inferred← citeshttps://doi.org/10.1016/j.tcs.2023.114344openalex-snapshot
Counting subwords in circular words and their Parikh matrices
inferred← citeshttps://doi.org/10.1142/s0129054111008969openalex-snapshot
ON THE EXISTENCE OF MINIMAL β-POWERS
inferred← citeshttps://doi.org/10.1142/s0129054118420078openalex-snapshot
Square-Free Partial Words with Many Wildcards
inferred← citeshttps://doi.org/10.37236/5424openalex-snapshot
Avoiding Letter Patterns in Ternary Square-Free Words
inferred← citeshttps://doi.org/10.37236/6003openalex-snapshot
A Ternary Square-free Sequence Avoiding Factors Equivalent to $abcacba$
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.4204/eptcs.151.18openalex-snapshot
Representations of Circular Words
inferred← citeshttps://doi.org/10.48550/arxiv.1010.5456openalex-snapshot
Combinatorial Characterization of Formal Languages
inferred← citeshttps://doi.org/10.48550/arxiv.1102.0980openalex-snapshot
The strong-connectivity of word-representable digraphs
inferred← citeshttps://doi.org/10.48550/arxiv.2001.11763openalex-snapshot
Lengths of extremal square-free ternary words
inferred← citeshttps://doi.org/10.48550/arxiv.2005.06235openalex-snapshot
There are level ternary circular square-free words of length $n$ for $n\ne 5,7,9,10,14,17.$
inferred← citeshttps://doi.org/10.55016/ojs/cdm.v16i1.69831openalex-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.