On the public citation graph
Finitely axiomatizable quasivarieties of graphs
0 signed · 29 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-0-8176-4842-8_19openalex-snapshot
Graph Theory and Probability
inferredcites →https://doi.org/10.1007/978-1-4613-8130-3openalex-snapshot
A Course in Universal Algebra
inferredcites →https://doi.org/10.1007/bf01040652openalex-snapshot
Universally axiomatizable subclasses of locally finite classes of models
inferredcites →https://doi.org/10.1007/bf01190252openalex-snapshot
How many variables does a quasivariety need?
inferredcites →https://doi.org/10.1007/bf02302476openalex-snapshot
Multiplication of classes of algebraic systems
inferredcites →https://doi.org/10.1016/0012-365x(78)90062-6openalex-snapshot
On classes of relations and graphs determined by subobjects and factorobjects
inferredcites →https://doi.org/10.1016/s1385-7258(54)50074-0openalex-snapshot
Contributions to the Theory of Models. I
inferredcites →https://doi.org/10.1090/s0002-9947-1979-0530057-2openalex-snapshot
The first order theory of 𝑁-colorable graphs
inferredcites →https://doi.org/10.1090/s0002-9947-1988-0946222-1openalex-snapshot
Finite Basis Theorems for Relatively Congruence-Distributive Quasivarieties
inferredcites →https://doi.org/10.2307/2268420openalex-snapshot
Alfred Tarski. Contributions to the theory of models. Koninklijke Nederlandse Akademie van Wetenschappen, Proceedings, series A, vol. 57 (1954), pp. 572–588, and vol. 58 (1955), pp. 56–64; also Indagationes mathematicae, vol. 16 (1954), pp. 572–588, and vol. 17 (1955), pp. 56–64.
inferredcites →https://doi.org/10.4064/fm-65-2-139-145openalex-snapshot
Atomic compactness and graph theory
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-66158-2_10openalex-snapshot
All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems
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/pl00022468openalex-snapshot
Antivarieties and colour-families of graphs
inferred← citeshttps://doi.org/10.1007/s00012-002-8170-7openalex-snapshot
The lattice of quasivarieties of undirected graphs
inferred← citeshttps://doi.org/10.1007/s00012-010-0097-9openalex-snapshot
Residual properties of pre-bipartite digraphs
inferred← citeshttps://doi.org/10.1007/s00012-018-0507-yopenalex-snapshot
Axiomatizations of universal classes through infinitary logic
inferred← citeshttps://doi.org/10.1007/s00012-018-0515-yopenalex-snapshot
Axiomatisability and hardness for universal Horn classes of hypergraphs
inferred← citeshttps://doi.org/10.1007/s00233-010-9268-4openalex-snapshot
Quasi-equational bases for graphs of semigroups, monoids and groups
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.1016/s0012-365x(01)00158-3openalex-snapshot
A family of universal pseudo-homogeneous G-colourable graphs
inferred← citeshttps://doi.org/10.1017/s0004972710000420openalex-snapshot
RESIDUAL PROPERTIES OF SIMPLE GRAPHS
inferred← citeshttps://doi.org/10.1023/a:1008637811027openalex-snapshot
Subdirect Decomposition of n-Chromatic Graphs
inferred← citeshttps://doi.org/10.1134/s003744662301010xopenalex-snapshot
On Universal Positive Graphs
inferred← citeshttps://doi.org/10.1142/s0218196706002846openalex-snapshot
INTERPRETING GRAPH COLORABILITY IN FINITE SEMIGROUPS
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.