On the public citation graph
Graphen mit transitiver Automorphismengruppe
0 signed · 26 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.1090/s0002-9939-1964-0159321-0openalex-snapshot
On a Theorem of Sabidussi
inferredcites →https://doi.org/10.2140/pjm.1951.1.481openalex-snapshot
Loops with transitive automorphism groups
inferredcites →https://doi.org/10.2307/2371830openalex-snapshot
Linear Graphs of Degree ≤ 6 and their Groups
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/bf02107568openalex-snapshot
Finite digraphs with given regular automorphism groups
inferred← citeshttps://doi.org/10.1007/bf02789317openalex-snapshot
On products of graphs and regular groups
inferred← citeshttps://doi.org/10.1007/s10231-021-01163-wopenalex-snapshot
On the asymptotic enumeration of Cayley graphs
inferred← citeshttps://doi.org/10.1007/s10801-009-0190-3openalex-snapshot
Infinite primitive directed graphs
inferred← citeshttps://doi.org/10.1007/s10801-020-00956-1openalex-snapshot
Cayley graphs with few automorphisms
inferred← citeshttps://doi.org/10.1016/0012-365x(77)90005-xopenalex-snapshot
On the structure of infinite vertex-transitive graphs
inferred← citeshttps://doi.org/10.1016/0095-8956(71)90008-6openalex-snapshot
Über das schwache kartesische Produkt von Graphen
inferred← citeshttps://doi.org/10.1016/0166-218x(94)00070-3openalex-snapshot
Labeled versus unlabeled distributed Cayley networks
inferred← citeshttps://doi.org/10.1016/j.endm.2018.06.015openalex-snapshot
2-closed abelian permutation groups
inferred← citeshttps://doi.org/10.1016/j.jcta.2017.08.001openalex-snapshot
Finite groups admitting an oriented regular representation
inferred← citeshttps://doi.org/10.1016/j.jctb.2017.05.003openalex-snapshot
Every finite non-solvable group admits an oriented regular representation
inferred← citeshttps://doi.org/10.1016/j.jctb.2019.10.003openalex-snapshot
On the existence of graphical Frobenius representations and their asymptotic enumeration
inferred← citeshttps://doi.org/10.1016/j.jctb.2026.09.005openalex-snapshot
Finding automorphism groups of double coset graphs and Cayley graphs are equivalent problems
inferred← citeshttps://doi.org/10.1016/s0095-8956(78)80008-2openalex-snapshot
Infinite digraphs with given regular automorphism groups
inferred← citeshttps://doi.org/10.26493/2590-9770.1242.809openalex-snapshot
Most rigid representations and Cayley index
inferred← citeshttps://doi.org/10.4153/cjm-1978-082-9openalex-snapshot
Regular Representation of Finite Groups by Hypergraphs
inferred← citeshttps://doi.org/10.4153/s0008414x23000093openalex-snapshot
Finite transitive groups having many suborbits of cardinality at most 2 and an application to the enumeration of Cayley graphs
inferred← citeshttps://doi.org/10.5802/ahl.118openalex-snapshot
Cayley graphs with few automorphisms: the case of infinite groups
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.