On the public citation graph
Distinguishing Number of Countable Homogeneous Relational Structures
0 signed · 36 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/bf02488043openalex-snapshot
Countable homogeneous partially ordered sets
inferredcites →https://doi.org/10.1016/j.dam.2007.10.009openalex-snapshot
Bell polynomials and k -generalized Dyck paths
inferredcites →https://doi.org/10.1016/s0049-237x(00)80061-0openalex-snapshot
Partitions of countable homogeneous systems
inferredcites →https://doi.org/10.1016/s0049-237x(09)70548-8openalex-snapshot
Homogeneous Directed Graphs. The Imprimitive Case
inferredcites →https://doi.org/10.1090/memo/0621openalex-snapshot
The classification of countable homogeneous directed graphs and countable homogeneous 𝑛-tournaments
inferredcites →https://doi.org/10.1090/s0002-9947-1980-0583847-2openalex-snapshot
Countable Ultrahomogeneous Undirected Graphs
inferredcites →https://doi.org/10.2307/2272734openalex-snapshot
Countable homogeneous relational structures and ℵ0-categorical theories
inferredcites →https://doi.org/10.24033/asens.1027openalex-snapshot
Sur l'extension aux relations de quelques propriétés des ordres
inferredcites →https://doi.org/10.37236/895openalex-snapshot
Bijective Proofs of Identities from Colored Binary Trees
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-25070-6_4openalex-snapshot
Strongly n-e.c. Graphs and Independent Distinguishing Labellings
inferred← citeshttps://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.1007/s10801-011-0313-5openalex-snapshot
Orbit equivalence and permutation groups defined by unordered relations
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.dam.2018.10.021openalex-snapshot
On the distinguishing number of cyclic tournaments: Towards the Albertson–Collins Conjecture
inferred← citeshttps://doi.org/10.1016/j.dam.2020.06.007openalex-snapshot
Distinguishing numbers and distinguishing indices of oriented graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.03.008openalex-snapshot
Extending precolorings to distinguish group actions
inferred← citeshttps://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferred← citeshttps://doi.org/10.1134/s1995080221040053openalex-snapshot
A Note on Computable Distinguishing Colorings
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/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/2117openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.37236/4873openalex-snapshot
Local Finiteness, Distinguishing Numbers, and Tucker's Conjecture
inferred← citeshttps://doi.org/10.37236/6openalex-snapshot
Finite Factors of Bernoulli Schemes and Distinguishing Labelings of Directed Graphs
inferred← citeshttps://doi.org/10.37236/8370openalex-snapshot
Distinguishing Number of Universal Homogeneous Urysohn Metric Spaces
inferred← citeshttps://doi.org/10.4310/joc.2010.v1.n2.a4openalex-snapshot
Distinguishing number and adjacency properties
inferred← citeshttps://doi.org/10.48550/arxiv.1203.5765openalex-snapshot
Nordhaus-Gaddum Theorem for the Distinguishing Chromatic Number
inferred← citeshttps://doi.org/10.48550/arxiv.1207.2649openalex-snapshot
Orbit-equivalent infinite permutation groups
inferred← citeshttps://doi.org/10.48550/arxiv.1301.0393openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.48550/arxiv.1311.4372openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
inferred← citeshttps://doi.org/10.48550/arxiv.1412.0881openalex-snapshot
Local finiteness, distinguishing numbers and Tucker's conjecture
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.