On the public citation graph
Distinguishability of Infinite Groups and Graphs
0 signed · 42 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.20190openalex-snapshot
Distinguishing Cartesian powers of graphs
inferredcites →https://doi.org/10.1007/bf01196649openalex-snapshot
On groups with no regular orbits on the set of subsets
inferredcites →https://doi.org/10.1016/0012-365x(86)90218-9openalex-snapshot
Regular orbits of permutation groups on the power set
inferredcites →https://doi.org/10.1016/j.ejc.2007.11.018openalex-snapshot
The distinguishing number of Cartesian products of complete graphs
inferredcites →https://doi.org/10.1090/s0002-9939-1962-0133816-6openalex-snapshot
The Kronecker Product of Graphs
inferredcites →https://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferredcites →https://doi.org/10.1112/s0024609397003536openalex-snapshot
Primitive Groups with no Regular Orbits on the Set of Subsets
inferredcites →https://doi.org/10.26493/1855-3974.192.531openalex-snapshot
Motion and distinguishing number two
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/947openalex-snapshot
Distinguishability of Locally Finite Trees
inferredcites →https://doi.org/10.4310/joc.2010.v1.n2.a4openalex-snapshot
Distinguishing number and adjacency properties
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.22704openalex-snapshot
Distinguishing orthogonality graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-77983-2_5openalex-snapshot
Symmetry Parameters for Mycielskian Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-08019-2_32openalex-snapshot
On the Effectiveness of Symmetry Breaking
inferred← citeshttps://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.1007/s10801-013-0434-0openalex-snapshot
Orbit-equivalent infinite permutation groups
inferred← citeshttps://doi.org/10.1007/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112512openalex-snapshot
The cost of 2-distinguishing hypercubes
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferred← citeshttps://doi.org/10.1016/j.ejc.2020.103139openalex-snapshot
Distinguishing density and the Distinct Spheres Condition
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.06.001openalex-snapshot
Breaking graph symmetries by edge colourings
inferred← citeshttps://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferred← citeshttps://doi.org/10.1017/etds.2021.89openalex-snapshot
Reconstructing a minimal topological dynamical system from a set of return times
inferred← citeshttps://doi.org/10.1017/s0963548313000382openalex-snapshot
Random Colourings and Automorphism Breaking in Locally Finite Graphs
inferred← citeshttps://doi.org/10.1134/s1995080221040053openalex-snapshot
A Note on Computable Distinguishing Colorings
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.334.fe4openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.26493/1855-3974.792.403openalex-snapshot
The distinguishing index of the Cartesian product of countable graphs
inferred← citeshttps://doi.org/10.26493/2590-9770.1463.f59openalex-snapshot
Paint cost and the frugal distinguishing number
inferred← citeshttps://doi.org/10.37236/3046openalex-snapshot
Bounding the Distinguishing Number of Infinite Graphs and Permutation Groups
inferred← citeshttps://doi.org/10.37236/3933openalex-snapshot
The Distinguishing Index of Infinite Graphs
inferred← citeshttps://doi.org/10.37236/4873openalex-snapshot
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture
inferred← citeshttps://doi.org/10.37236/7281openalex-snapshot
Distinguishing Graphs of Maximum Valence 3
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.1902openalex-snapshot
Distinguishing Cartesian products of countable graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2438openalex-snapshot
Determining number and cost of generalized Mycielskian 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.