On the public citation graph
Endomorphism Breaking in Graphs
0 signed · 25 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.1016/0095-8956(84)90021-2openalex-snapshot
On the minimum order of graphs with given semigroup
inferredcites →https://doi.org/10.1016/j.disc.2007.04.070openalex-snapshot
Distinguishing colorings of Cartesian products of complete graphs
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.1016/j.jalgebra.2006.01.045openalex-snapshot
Distinguishing labellings of group action on vector spaces and graphs
inferredcites →https://doi.org/10.1112/s0024609302221372openalex-snapshot
ALGEBRAIC GRAPH THEORY (Graduate Texts in Mathematics 207)
inferredcites →https://doi.org/10.26493/1855-3974.334.fe4openalex-snapshot
Distinguishing graphs with infinite motion and nonlinear growth
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
inferred← citeshttps://doi.org/10.1016/j.dam.2017.10.006openalex-snapshot
The list distinguishing number of Kneser graphs
inferred← citeshttps://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferred← citeshttps://doi.org/10.1017/jsl.2017.74openalex-snapshot
PAIRWISE NONISOMORPHIC MAXIMAL-CLOSED SUBGROUPS OF SYM(ℕ) VIA THE CLASSIFICATION OF THE REDUCTS OF THE HENSON DIGRAPHS
inferred← citeshttps://doi.org/10.26493/1855-3974.751.9a8openalex-snapshot
Distinguishing graphs by total colourings
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/1855-3974.848.669openalex-snapshot
χ_D(G), |Aut(G)|, and a variant of the motion lemma
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/3933openalex-snapshot
The Distinguishing Index of Infinite Graphs
inferred← citeshttps://doi.org/10.4153/s0008414x25101466openalex-snapshot
Relative elegance and Cartesian cubes with one connection
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.