On the public citation graph

Pathwidth and Nonrepetitive List Coloring

0 signed · 19 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.10057openalex-snapshot

Nonrepetitive colorings of graphs

inferredcites →https://doi.org/10.1007/978-3-7643-7400-6_16openalex-snapshot

Nonrepetitive Graph Coloring

inferredcites →https://doi.org/10.1007/s00493-015-3070-6openalex-snapshot

Nonrepetitive colouring via entropy compression

inferredcites →https://doi.org/10.1016/j.dam.2011.07.017openalex-snapshot

Thue choosability of trees

inferredcites →https://doi.org/10.1016/j.disc.2005.11.071openalex-snapshot

Pattern avoidance on graphs

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.1137/120866361openalex-snapshot

Nonrepetitive Choice Number of Trees

inferredcites →https://doi.org/10.37236/3153openalex-snapshot

Nonrepetitive Colourings of Planar Graphs with $O(\log n)$ Colours

inferredcites →https://doi.org/10.48550/arxiv.0903.0544openalex-snapshot

A constructive proof of the general Lovasz Local Lemma

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/s00220-018-3096-xopenalex-snapshot

Charting the Replica Symmetric Phase

inferred← citeshttps://doi.org/10.1007/s00373-017-1816-1openalex-snapshot

New Bounds for Facial Nonrepetitive Colouring

inferred← citeshttps://doi.org/10.1016/j.jctb.2018.06.007openalex-snapshot

The list chromatic number of graphs with small clique number

inferred← citeshttps://doi.org/10.1090/mcom/3732openalex-snapshot

Avoiding squares over words with lists of size three amongst four symbols

inferred← citeshttps://doi.org/10.1109/focs.2019.00049openalex-snapshot

Beyond the Lovász Local Lemma: Point to Set Correlations and Their Algorithmic Applications

inferred← citeshttps://doi.org/10.19086/aic.12100openalex-snapshot

Planar graphs have bounded nonrepetitive chromatic number

inferred← citeshttps://doi.org/10.37236/6267openalex-snapshot

Anagram-Free Graph Colouring

inferred← citeshttps://doi.org/10.37236/7129openalex-snapshot

Every Plane Graph is Facially-Non-Repetitively $C$-choosable

inferred← citeshttps://doi.org/10.37236/9777openalex-snapshot

Nonrepetitive Graph Colouring

inferred← citeshttps://doi.org/10.4230/lipics.approx-random.2018.44openalex-snapshot

Commutative Algorithms Approximate the LLL-distribution

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.