On the public citation graph
Non-Repetitive 3-Coloring of Subdivided Graphs
0 signed · 22 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/j.dam.2008.04.015openalex-snapshot
The complexity of nonrepetitive coloring
inferredcites →https://doi.org/10.1016/j.disc.2006.06.017openalex-snapshot
Nonrepetitive colorings of trees
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.1002/jgt.20488openalex-snapshot
Facial non-repetitive edge-coloring of plane graphs
inferred← citeshttps://doi.org/10.1002/jgt.22430openalex-snapshot
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
inferred← citeshttps://doi.org/10.1002/rsa.20347openalex-snapshot
Nonrepetitive list colourings of paths
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.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.12.001openalex-snapshot
Online version of the theorem of Thue
inferred← citeshttps://doi.org/10.1051/ita/2011122openalex-snapshot
Repetition thresholds for subdivided graphs and trees
inferred← citeshttps://doi.org/10.1137/17m1145574openalex-snapshot
Anagram-Free Colorings of Graph Subdivisions
inferred← citeshttps://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferred← citeshttps://doi.org/10.22215/etd/2015-10989openalex-snapshot
Facial Nonrepetitive Graph Colourings
inferred← citeshttps://doi.org/10.37236/10370openalex-snapshot
Nonrepetitively 3-Colorable Subdivisions of Graphs with a Logarithmic Number of Subdivisions per edge
inferred← citeshttps://doi.org/10.37236/3153openalex-snapshot
Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours
inferred← citeshttps://doi.org/10.48550/arxiv.1204.6687openalex-snapshot
Online version of the theorem of Thue
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02559openalex-snapshot
The Thue choice number versus the Thue chromatic number of graphs
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.