On the public citation graph

Quasivarieties of graphs

0 signed · 17 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01149807openalex-snapshot
Quasivarieties of unars
inferredcites →https://doi.org/10.1007/bf01188054openalex-snapshot
The lattice of quasivarieties of semigroups
inferredcites →https://doi.org/10.1007/bf01669475openalex-snapshot
Covers in lattices of quasivarieties and independent axiomatizability
inferredcites →https://doi.org/10.1007/bf01669836openalex-snapshot
Quasivarieties of unary algebras with a finite number of cycles

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-319-78235-5_7openalex-snapshot
Pure Unary Relational Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_20openalex-snapshot
The Algebra of Adjacency Patterns: Rees Matrix Semigroups with Reversion
inferred← citeshttps://doi.org/10.1007/bf02671614openalex-snapshot
The lattice complexity of quasivarieties of graphs and endographs
inferred← citeshttps://doi.org/10.1007/s00012-010-0097-9openalex-snapshot
Residual properties of pre-bipartite digraphs
inferred← citeshttps://doi.org/10.1007/s10469-015-9344-7openalex-snapshot
Complexity of Quasivariety Lattices
inferred← citeshttps://doi.org/10.1007/s10469-019-09531-5openalex-snapshot
Structure of Quasivariety Lattices. II. Undecidable Problems
inferred← citeshttps://doi.org/10.1007/s10469-019-09539-xopenalex-snapshot
ω-Independent Bases for Quasivarieites of Torsion-Free Groups
inferred← citeshttps://doi.org/10.1007/s10485-007-9122-3openalex-snapshot
Almost ff-universality Implies Q-universality
inferred← citeshttps://doi.org/10.1007/s11225-005-7378-xopenalex-snapshot
Open questions related to the problem of Birkhoff and Maltsev
inferred← citeshttps://doi.org/10.1023/a:1016024925028openalex-snapshot
$$\mathcal{Q}$$ -Universal Quasivarieties of Graphs
inferred← citeshttps://doi.org/10.1134/s0037446618030011openalex-snapshot
Quasiequational Bases of Cantor Algebras
inferred← citeshttps://doi.org/10.1142/s0218196714500489openalex-snapshot
Lattices of subclasses. II
inferred← citeshttps://doi.org/10.3103/s1055134418010042openalex-snapshot
Quasivarieties of Graphs and Independent Axiomatizability
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.