On the public citation graph
New Lower Bounds on the Non-Repetitive Chromatic Number of Some Graphs
0 signed · 11 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.dam.2024.08.018openalex-snapshot
On nonrepetitive colorings of paths and cycles
inferredcites →https://doi.org/10.1016/j.disc.2006.06.017openalex-snapshot
Nonrepetitive colorings of trees
inferredcites →https://doi.org/10.1016/j.disc.2007.08.043openalex-snapshot
Nonrepetitive colorings of graphs of bounded tree-width
inferredcites →https://doi.org/10.1145/3385731openalex-snapshot
Planar Graphs Have Bounded Queue-Number
inferredcites →https://doi.org/10.19086/aic.12100openalex-snapshot
Planar graphs have bounded nonrepetitive chromatic number
inferredcites →https://doi.org/10.37236/1671openalex-snapshot
There Are Ternary Circular Square-Free Words of Length $n$ for $n\ge 18$
inferredcites →https://doi.org/10.48550/arxiv.1909.02612openalex-snapshot
A note about online nonrepetitive coloring $k$-trees
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.