On the public citation graph
Regul�re Graphen beliebigen Grades mit vorgegebenen Eigenschaften
0 signed · 24 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/978-1-4612-2972-8_4openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.1007/bf01295203openalex-snapshot
Unendliche Graphen endlichen Grades mit vorgegebenen Eigenschaften
inferredcites →https://doi.org/10.1007/bf01299094openalex-snapshot
On the minimum order of graphs with given automorphism group
inferredcites →https://doi.org/10.1007/bf01306916openalex-snapshot
Regul�re Graphen 3., 4. und 5. Grades mit vorgegebenen abstrakten Automorphismengruppen, Farbenzahlen und Zusammenh�ngen
inferredcites →https://doi.org/10.1112/jlms/s1-27.1.85openalex-snapshot
A Property of 4-Chromatic Graphs and some Remarks on Critical Graphs
inferredcites →https://doi.org/10.2307/2371086openalex-snapshot
Congruent Graphs and the Connectivity of Graphs
inferredcites →https://doi.org/10.4153/cjm-1949-033-6openalex-snapshot
Graphs of Degree Three with a Given Abstract Group
inferredcites →https://doi.org/10.4153/cjm-1957-060-7openalex-snapshot
Graphs with Given Group and Given Graph-Theoretical 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.3190100406openalex-snapshot
Representing groups by graphs with constant link and hypergraphs
inferred← citeshttps://doi.org/10.1007/bf01299955openalex-snapshot
On the problem of reconstructing a tournament from subtournaments
inferred← citeshttps://doi.org/10.1007/bf01894629openalex-snapshot
Groups of graphs on given surfaces
inferred← citeshttps://doi.org/10.1007/bfb0060105openalex-snapshot
Section graphs for finite permutation groups
inferred← citeshttps://doi.org/10.1007/s00373-024-02831-3openalex-snapshot
A Note on Asymmetric Hypergraphs
inferred← citeshttps://doi.org/10.1016/0012-365x(72)90010-6openalex-snapshot
Automorphism groups of planar graphs I
inferred← citeshttps://doi.org/10.1016/0012-365x(74)90104-6openalex-snapshot
Automorphism groups of graphs and edge-contraction
inferred← citeshttps://doi.org/10.1016/0012-365x(75)90037-0openalex-snapshot
On graphs with a constant link, II
inferred← citeshttps://doi.org/10.1016/0012-365x(76)90057-1openalex-snapshot
Extremal edge problems for graphs with given hyperoctahedral automorphism group
inferred← citeshttps://doi.org/10.1016/j.disc.2006.03.012openalex-snapshot
Automorphism groups of graphs and edge-contraction
inferred← citeshttps://doi.org/10.1016/s0021-9800(69)80034-7openalex-snapshot
Section graphs for finite permutation 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.