The following pages link to The core of a graph (Q686290):
Displaying 16 items.
- 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)
- (Q5471356) (← links)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs (Q5858645) (← links)
- Removal lemmas and approximate homomorphisms (Q5886340) (← links)
- Testing subgraphs in directed graphs (Q5917574) (← links)
- CoReS: a tool for computing core graphs via SAT/SMT solvers (Q5918209) (← links)
- The smallest hard trees (Q6073305) (← links)
- Minimum degree and the graph removal lemma (Q6094041) (← links)
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA (Q6104494) (← links)
- Arboreal categories and equi-resource homomorphism preservation theorems (Q6131200) (← links)
- Robust Factorizations and Colorings of Tensor Graphs (Q6195952) (← links)
- Homomorphisms between graphs embedded in surfaces (Q6201918) (← links)
- An algorithmic framework for locally constrained homomorphisms (Q6499010) (← links)