The following pages link to The core of a graph (Q686290):
Displaying 50 items.
- On the data complexity of consistent query answering (Q269317) (← links)
- Bare canonicity of representable cylindric and polyadic algebras (Q387126) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- On the equivalence of distributed systems with queries and communication (Q389221) (← links)
- Enumerating homomorphisms (Q414933) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- The complexity of equivalence, entailment, and minimization in existential positive logic (Q473196) (← links)
- Shifts of the stable Kneser graphs and hom-idempotence (Q518173) (← links)
- Foundations of semantic web databases (Q532369) (← links)
- Data exchange: semantics and query answering (Q555772) (← links)
- Dualities and dual pairs in Heyting algebras (Q603889) (← links)
- On the homomorphism order of labeled posets (Q634750) (← links)
- A more general theory of static approximations for conjunctive queries (Q778535) (← links)
- Minimal universal and dense minor closed classes (Q852708) (← links)
- Conjunctive query evaluation by search-tree revisited (Q870265) (← links)
- A generalization of the Łoś-Tarski preservation theorem (Q904143) (← links)
- Maximal infinite-valued constraint languages (Q1014639) (← links)
- Generalized symmetry of graphs - a survey (Q1044907) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Graph homomorphisms with infinite targets (Q1336635) (← links)
- The complexity of restricted graph homomorphisms (Q1356452) (← links)
- Gibbs measures and dismantlable graphs (Q1569061) (← links)
- Counting \(H-\)colorings of partial \(k-\)trees (Q1603695) (← links)
- Triangle-free graphs and forbidden subgraphs (Q1613361) (← links)
- On retracts, absolute retracts, and foldings in cographs (Q1749782) (← links)
- Homomorphically full graphs (Q1917297) (← links)
- Complexity of tree homomorphisms (Q1923593) (← links)
- A homotopy category for graphs (Q2038908) (← links)
- How many variables are needed to express an existential positive query? (Q2322719) (← links)
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree (Q2348037) (← links)
- Graph homomorphisms via vector colorings (Q2422244) (← links)
- Chromatic numbers and products (Q2570106) (← links)
- RESIDUAL PROPERTIES OF SIMPLE GRAPHS (Q3065426) (← links)
- Convex-round graphs are circular-perfect (Q3150195) (← links)
- A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
- Preserving Constraints with the Stable Chase (Q3305357) (← links)
- Covers of Query Results (Q3305362) (← links)
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings (Q3466338) (← links)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results (Q3655143) (← links)
- (Q4638077) (← links)
- Path homomorphisms (Q4892428) (← links)
- Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation (Q4957206) (← links)
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side (Q5026391) (← links)
- (Q5091112) (← links)
- Testing the Complexity of a Valued CSP Language (Q5091236) (← links)
- Generalized K-Core Percolation in Networks with Community Structure (Q5113802) (← links)
- Schema Mappings: A Case of Logical Dynamics in Database Theory (Q5249666) (← links)
- FREE ADEQUATE SEMIGROUPS (Q5389477) (← links)
- On the complexity of existential positive queries (Q5410336) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)