On the public citation graph
The Distinguishing Index of Infinite Graphs
0 signed · 24 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.1007/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferredcites →https://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferredcites →https://doi.org/10.1016/j.tcs.2017.02.032openalex-snapshot
Edge motion and the distinguishing index
inferredcites →https://doi.org/10.26493/1855-3974.334.fe4openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferredcites →https://doi.org/10.26493/1855-3974.792.403openalex-snapshot
The distinguishing index of the Cartesian product of countable graphs
inferredcites →https://doi.org/10.37236/1361openalex-snapshot
A Note on the Asymptotics and Computational Complexity of Graph Distinguishability
inferredcites →https://doi.org/10.37236/2283openalex-snapshot
Distinguishability of Infinite Groups and Graphs
inferredcites →https://doi.org/10.37236/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferredcites →https://doi.org/10.4064/aa-9-4-331-340openalex-snapshot
Universal graphs and universal functions
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.22496openalex-snapshot
The optimal general upper bound for the distinguishing index of infinite graphs
inferred← citeshttps://doi.org/10.1002/jgt.23013openalex-snapshot
The distinguishing index of graphs with infinite minimum degree
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111959openalex-snapshot
On symmetries of edge and vertex colourings of graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103145openalex-snapshot
A bound for the distinguishing index of regular graphs
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.06.001openalex-snapshot
Breaking graph symmetries by edge colourings
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.02.032openalex-snapshot
Edge motion and the distinguishing index
inferred← citeshttps://doi.org/10.18690/978-961-286-113-1.8openalex-snapshot
Distinguishing graphs of maximum valence 3
inferred← citeshttps://doi.org/10.26493/1855-3974.1852.4f7openalex-snapshot
The distinguishing index of connected graphs without pendant edges
inferred← citeshttps://doi.org/10.26493/1855-3974.3453.4a8openalex-snapshot
Brooks' type theorems for coloring parameters of locally finite graphs and Kőnig's Lemma
inferred← citeshttps://doi.org/10.26493/1855-3974.909.0e1openalex-snapshot
The distinguishing index of the Cartesian product of finite graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1504.f7aopenalex-snapshot
Number of colors needed to break symmetries of a graph by an arbitrary edge coloring
inferred← citeshttps://doi.org/10.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
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.