On the public citation graph
Notes on Nonrepetitive Graph Colouring
0 signed · 61 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.1002/jgt.20183openalex-snapshot
Vertex partitions of chordal graphs
inferredcites →https://doi.org/10.1002/jgt.3190200412openalex-snapshot
Some results on tree decomposition of graphs
inferredcites →https://doi.org/10.1007/0-387-22444-0_4openalex-snapshot
Algorithmic Aspects of Tree Width
inferredcites →https://doi.org/10.1007/978-3-642-55566-4_29openalex-snapshot
Colorings and Homomorphisms of Minor Closed Classes
inferredcites →https://doi.org/10.1007/bf02764716openalex-snapshot
Acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/0012-365x(79)90077-3openalex-snapshot
On acyclic colorings of planar graphs
inferredcites →https://doi.org/10.1016/j.disc.2005.11.071openalex-snapshot
Pattern avoidance on graphs
inferredcites →https://doi.org/10.1016/j.disc.2006.03.017openalex-snapshot
On acyclic colorings of planar graphs
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.07.063openalex-snapshot
Breaking the rhythm on graphs
inferredcites →https://doi.org/10.1016/j.disc.2007.08.039openalex-snapshot
Thue type problems for graphs, points, and numbers
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.1016/j.endm.2005.06.077openalex-snapshot
Nonrepetitive colorings of graphs
inferredcites →https://doi.org/10.1016/j.endm.2007.01.063openalex-snapshot
Nonrepetitive colorings of graphs
inferredcites →https://doi.org/10.1016/j.tcs.2005.01.004openalex-snapshot
Pattern avoidance: themes and variations
inferredcites →https://doi.org/10.1016/s0304-3975(97)00228-4openalex-snapshot
A partial k-arboretum of graphs with bounded treewidth
inferredcites →https://doi.org/10.1137/s0097539702416141openalex-snapshot
Layout of Graphs with Bounded Tree-Width
inferredcites →https://doi.org/10.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
inferredcites →https://doi.org/10.1556/sscmath.2007.1029openalex-snapshot
On square-free vertex colorings of graphs
inferredcites →https://doi.org/10.37236/1660openalex-snapshot
Thue-like Sequences and Rainbow Arithmetic Progressions
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.46298/dmtcs.3415openalex-snapshot
Nonrepetitive colorings of graphs
inferredcites →https://doi.org/10.46298/dmtcs.344openalex-snapshot
Acyclic, Star and Oriented Colourings of Graph Subdivisions
inferredcites →https://doi.org/10.48550/arxiv.0709.4497openalex-snapshot
The complexity of nonrepetitive edge coloring 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/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.1007/978-3-031-47417-0_11openalex-snapshot
Tree-Partitions with Bounded Degree Trees
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/s10479-014-1537-2openalex-snapshot
Restricted coloring problems on Graphs with few P 4’s
inferred← citeshttps://doi.org/10.1016/j.dam.2008.04.015openalex-snapshot
The complexity of nonrepetitive coloring
inferred← citeshttps://doi.org/10.1016/j.dam.2024.08.018openalex-snapshot
On nonrepetitive colorings of paths and cycles
inferred← citeshttps://doi.org/10.1016/j.disc.2006.06.017openalex-snapshot
Nonrepetitive colorings of trees
inferred← citeshttps://doi.org/10.1016/j.disc.2025.114828openalex-snapshot
The nonrepetitive coloring of grids
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.procs.2023.08.241openalex-snapshot
On nonrepetitive colorings of cycles
inferred← citeshttps://doi.org/10.1017/s0963548323000457openalex-snapshot
Product structure of graph classes with bounded treewidth
inferred← citeshttps://doi.org/10.1137/17m1145574openalex-snapshot
Anagram-Free Colorings of Graph Subdivisions
inferred← citeshttps://doi.org/10.1155/2007/74639openalex-snapshot
Nonrepetitive Colorings of GraphsA Survey
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.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/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.46298/dmtcs.2077openalex-snapshot
Nonrepetitive colorings of lexicographic product of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1106.4106openalex-snapshot
Square-free Walks on Labelled Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1107.0056openalex-snapshot
Fixed parameter algorithms for restricted coloring problems
inferred← citeshttps://doi.org/10.48550/arxiv.1708.09571openalex-snapshot
Anagram-free colourings of graph subdivisions
inferred← citeshttps://doi.org/10.48550/arxiv.2103.04670openalex-snapshot
Queue layouts and nonrepetitive colouring of planar graphs and powers of trees
inferred← citeshttps://doi.org/10.5753/etc.2022.222730openalex-snapshot
On the maximum number of edges in a graph with prescribed walk-nonrepetitive chromatic number
inferred← citeshttps://doi.org/10.5802/igt.10openalex-snapshot
Product Structure of Graph Classes with Strongly Sublinear Separators
inferred← citeshttps://doi.org/10.7151/dmgt.2032openalex-snapshot
A note on the Thue chromatic number of lexicographic produts 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.