On the public citation graph
Distinguishability of Locally Finite Trees
0 signed · 40 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/bf02992834openalex-snapshot
Automorphisms and endomorphisms of infinite locally finite graphs
inferredcites →https://doi.org/10.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferredcites →https://doi.org/10.37236/1037openalex-snapshot
On Computing the Distinguishing Numbers of Trees and Forests
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.1002/jgt.22809openalex-snapshot
Distinguishing infinite graphs with bounded degrees
inferred← citeshttps://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.1007/s00605-020-01420-9openalex-snapshot
Asymmetrizing trees of maximum valence $$2^{\aleph _0}$$
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.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2009.11.021openalex-snapshot
The distinguishing chromatic number of Cartesian products of two complete graphs
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.2018.03.008openalex-snapshot
Extending precolorings to distinguish group actions
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2015.12.019openalex-snapshot
Automorphisms of restricted parabolic trees and Sylow p-subgroups of the finitary symmetric group
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2021.10.033openalex-snapshot
Asymmetric coloring of locally finite graphs and profinite permutation groups: Tucker's Conjecture confirmed
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.06.001openalex-snapshot
Breaking graph symmetries by edge colourings
inferred← citeshttps://doi.org/10.1017/s0963548313000382openalex-snapshot
Random Colourings and Automorphism Breaking in Locally Finite Graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2878.a61openalex-snapshot
On asymmetric colourings of graphs with bounded degrees and infinite motion
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/177openalex-snapshot
Bounds on the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/2283openalex-snapshot
Distinguishability of Infinite Groups and Graphs
inferred← citeshttps://doi.org/10.37236/2407openalex-snapshot
Graphs with Large Distinguishing Chromatic 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/3066openalex-snapshot
The Distinguishing Chromatic Number of Kneser Graphs
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.4310/joc.2010.v1.n2.a4openalex-snapshot
Distinguishing number and adjacency properties
inferred← citeshttps://doi.org/10.48550/arxiv.2006.03739openalex-snapshot
Distinguishing Generalized Mycielskian Graphs
inferred← citeshttps://doi.org/10.7151/dmgt.2162openalex-snapshot
Trees with distinguishing index equal distinguishing number plus one
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.