On the public citation graph
Groups of graphs on given surfaces
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/bf01319048openalex-snapshot
Regul�re Graphen beliebigen Grades mit vorgegebenen Eigenschaften
inferredcites →https://doi.org/10.1007/bf02075357openalex-snapshot
Automorphismen von polyedrischen Graphen
inferredcites →https://doi.org/10.1007/bf02993245openalex-snapshot
Das Geschlecht des vollständigen paaren Graphen
inferredcites →https://doi.org/10.1016/0012-365x(72)90010-6openalex-snapshot
Automorphism groups of planar graphs I
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.3190010207openalex-snapshot
Some applications of graph contractions
inferred← citeshttps://doi.org/10.1002/jgt.3190150605openalex-snapshot
Vertex‐transitive graphs and vertex‐transitive maps
inferred← citeshttps://doi.org/10.1007/bf01095641openalex-snapshot
Polynomial isomorphism algorithm for graphs which do not pinch to K3,g
inferred← citeshttps://doi.org/10.1007/bf01901750openalex-snapshot
A remark on contraction of graphs with given group
inferred← citeshttps://doi.org/10.1007/bf02579147openalex-snapshot
On automorphisms of infinite graphs with forbidden subgraphs
inferred← citeshttps://doi.org/10.1007/bfb0070361openalex-snapshot
Chromatic number and subgraphs of cayley graphs
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/b978-044488002-4/50029-4openalex-snapshot
10.1016/b978-044488002-4/50029-4
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/s0034-5288(18)32998-9openalex-snapshot
A 14/20 Robertsonian translocation in Swiss Simmental cattle
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)72823-8openalex-snapshot
On Automorphisms of Graphs with Forbidden Subgraphs
inferred← citeshttps://doi.org/10.1111/j.1749-6632.1979.tb17775.xopenalex-snapshot
THE CONSTRUCTION OF MINIMAL‐LINE GRAPHS WITH GIVEN AUTOMORPHISM GROUP
inferred← citeshttps://doi.org/10.2460/javma.2000.216.65openalex-snapshot
Cytogenetic survey of Holstein bulls at a commercial artificial insemination company to determine prevalence of bulls with centric fusion and chimeric anomalies
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.