On the public citation graph

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

https://doi.org/10.37236/3153
0 signed · 54 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/jgt.20029openalex-snapshot
Star coloring of graphs
inferredcites →https://doi.org/10.1002/jgt.20488openalex-snapshot
Facial non-repetitive edge-coloring of plane graphs
inferredcites →https://doi.org/10.1002/jgt.21695openalex-snapshot
Facial Nonrepetitive Vertex Coloring of Plane Graphs
inferredcites →https://doi.org/10.1002/rsa.10057openalex-snapshot
Nonrepetitive colorings of graphs
inferredcites →https://doi.org/10.1002/rsa.20347openalex-snapshot
Nonrepetitive list colourings of paths
inferredcites →https://doi.org/10.1002/rsa.20354openalex-snapshot
Highly nonrepetitive sequences: Winning strategies from the local lemma
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/978-3-7643-7400-6_16openalex-snapshot
Nonrepetitive Graph Coloring
inferredcites →https://doi.org/10.1007/s00453-004-1106-1openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families, Revisited
inferredcites →https://doi.org/10.1007/s004530010020openalex-snapshot
Diameter and Treewidth in Minor-Closed Graph Families
inferredcites →https://doi.org/10.1007/s00493-003-0037-9openalex-snapshot
Local Tree-Width, Excluded Minors, and Approximation Algorithms
inferredcites →https://doi.org/10.1007/s00493-015-3070-6openalex-snapshot
Nonrepetitive colouring via entropy compression
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.2011.07.017openalex-snapshot
Thue choosability of trees
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.disc.2011.09.027openalex-snapshot
Nonrepetitive vertex colorings of graphs
inferredcites →https://doi.org/10.1016/j.ejc.2005.01.010openalex-snapshot
Tree-depth, subgraph coloring and homomorphism bounds
inferredcites →https://doi.org/10.1016/j.ejc.2011.09.008openalex-snapshot
Characterisations and examples of graph classes with bounded expansion
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.1137/0136016openalex-snapshot
A Separator Theorem for Planar Graphs
inferredcites →https://doi.org/10.1137/s0895480103433410openalex-snapshot
Bidimensional Parameters and Local Treewidth
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.37236/1779openalex-snapshot
Coloring with no $2$-Colored $P_4$'s
inferredcites →https://doi.org/10.37236/253openalex-snapshot
Non-Repetitive 3-Coloring of Subdivided Graphs
inferredcites →https://doi.org/10.37236/823openalex-snapshot
Notes on Nonrepetitive Graph Colouring
inferredcites →https://doi.org/10.48550/arxiv.0709.4497openalex-snapshot
The complexity of nonrepetitive edge coloring of graphs
inferredcites →https://doi.org/10.48550/arxiv.math/0307365openalex-snapshot
A note on non-repetitive colourings of planar graphs
inferredcites →https://doi.org/10.5555/982792.982919openalex-snapshot
Equivalence of local treewidth and linear local treewidth and its algorithmic applications

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.22430openalex-snapshot
Nonrepetitive colorings of graphs excluding a fixed immersion or topological minor
inferred← citeshttps://doi.org/10.1007/978-3-319-50106-2_39openalex-snapshot
Stack and Queue Layouts via Layered Separators
inferred← citeshttps://doi.org/10.1007/s00373-017-1816-1openalex-snapshot
New Bounds for Facial Nonrepetitive Colouring
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.05.013openalex-snapshot
Nonrepetitive colorings of line arrangements
inferred← citeshttps://doi.org/10.1016/j.ipl.2012.12.001openalex-snapshot
Online version of the theorem of Thue
inferred← citeshttps://doi.org/10.1016/j.jctb.2014.07.005openalex-snapshot
Graph layouts via layered separators
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.006openalex-snapshot
Layered separators in minor-closed graph classes with applications
inferred← citeshttps://doi.org/10.1109/focs.2013.38openalex-snapshot
Layered Separators for Queue Layouts, 3D Graph Drawing and Nonrepetitive Coloring
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.23638/dmtcs-19-1-18openalex-snapshot
Nonrepetitive edge-colorings of trees
inferred← citeshttps://doi.org/10.37236/5855openalex-snapshot
Pathwidth and Nonrepetitive List Coloring
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.48550/arxiv.1204.6687openalex-snapshot
Online version of the theorem of Thue
inferred← citeshttps://doi.org/10.48550/arxiv.1207.5155openalex-snapshot
Nonrepetitive choice number of trees
inferred← citeshttps://doi.org/10.48550/arxiv.1508.02559openalex-snapshot
The Thue choice number versus the Thue chromatic number of graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1708.02114openalex-snapshot
Layouts for Plane Graphs on Constant Number of Tracks
inferred← citeshttps://doi.org/10.48550/arxiv.2106.01521openalex-snapshot
Avoiding large squares in trees and planar 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.