On the public citation graph
Distinguishing Graphs of Maximum Valence 3
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.1007/3-540-60618-1_64openalex-snapshot
A dynamic algorithm for line graph recognition
inferredcites →https://doi.org/10.1007/bf01196649openalex-snapshot
On groups with no regular orbits on the set of subsets
inferredcites →https://doi.org/10.1007/bf01896481openalex-snapshot
Asymmetric trees with two prescribed degrees
inferredcites →https://doi.org/10.1007/s00493-015-3071-5openalex-snapshot
Distinguishing graphs with intermediate growth
inferredcites →https://doi.org/10.1007/s10801-014-0529-2openalex-snapshot
Infinite motion and 2-distinguishability of graphs and groups
inferredcites →https://doi.org/10.1016/j.ejc.2014.11.003openalex-snapshot
Distinguishing graphs by edge-colourings
inferredcites →https://doi.org/10.1017/9781316576571.005openalex-snapshot
The Cost of Distinguishing Graphs
inferredcites →https://doi.org/10.1112/blms/bdq096openalex-snapshot
Base size, metric dimension and other invariants of groups and graphs
inferredcites →https://doi.org/10.1112/s0024609397003536openalex-snapshot
Primitive Groups with no Regular Orbits on the Set of Subsets
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/3223openalex-snapshot
The Cost of 2-Distinguishing Cartesian Powers
inferredcites →https://doi.org/10.37236/3933openalex-snapshot
The Distinguishing Index of Infinite Graphs
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.22809openalex-snapshot
Distinguishing infinite graphs with bounded degrees
inferred← citeshttps://doi.org/10.1016/j.disc.2021.112734openalex-snapshot
Cubic vertex-transitive graphs of girth six
inferred← citeshttps://doi.org/10.26493/1855-3974.1849.148openalex-snapshot
Distinguishing numbers of finite 4-valent vertex-transitive graphs
inferred← citeshttps://doi.org/10.26493/1855-3974.2354.616openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
inferred← citeshttps://doi.org/10.26493/1855-3974.2878.a61openalex-snapshot
On asymmetric colourings of graphs with bounded degrees and infinite motion
inferred← citeshttps://doi.org/10.26493/1855-3974.3453.4a8openalex-snapshot
Brooks' type theorems for coloring parameters of locally finite graphs and Kőnig's Lemma
inferred← citeshttps://doi.org/10.26493/2590-9770.1395.a37openalex-snapshot
Finite and infinite vertex-transitive cubic graphs and their distinguishing cost and density
inferred← citeshttps://doi.org/10.37236/8886openalex-snapshot
On Asymmetric Colourings of Claw-Free Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2005.09716openalex-snapshot
Coarse distinguishability of graphs with symmetric growth
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.