The core of a graph
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 841601
- scientific article; zbMATH DE number 434696
- scientific article; zbMATH DE number 5030278
- Cores of geometric graphs
- scientific article; zbMATH DE number 1151847
- On the core of a unicyclic graph
- Center of a graph with respect to edges
- The absolute centre of a graph
- Cores and shells of graphs.
- Cores of cubelike graphs
Cites work
- scientific article; zbMATH DE number 3650785 (Why is no real title available?)
- scientific article; zbMATH DE number 3463659 (Why is no real title available?)
- scientific article; zbMATH DE number 3390813 (Why is no real title available?)
- Chromatically optimal rigid graphs
- Cohomomorphisms of graphs and hypergraphs
- Color-families are dense
- Endomorphisms of graphs. II: Various unretractive graphs
- Fixed-edge theorem for graphs with loops
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
- Matching theory
- Minimum node covers and 2-bicritical graphs
- On minimal graphs
- On the complexity of H-coloring
- The Complexity of Colouring by Semicomplete Digraphs
- The effect of two cycles on the complexity of colourings by directed graphs
- Unretractive and S-unretractive joins and lexicographic products of graphs
Cited in
(82)- How many variables are needed to express an existential positive query?
- Chromatic numbers and products
- Arboreal categories and equi-resource homomorphism preservation theorems
- Preserving constraints with the stable chase
- The complexity of restricted graph homomorphisms
- On retracts, absolute retracts, and foldings in cographs
- Residual properties of simple graphs
- scientific article; zbMATH DE number 7561463 (Why is no real title available?)
- Graph homomorphisms with infinite targets
- Decidability of quasi-dense modal logics
- On the data complexity of consistent query answering
- Conjunctive query evaluation by search-tree revisited
- Testing subgraphs in directed graphs
- Enumerating homomorphisms
- Colouring, constraint satisfaction, and complexity
- Cores of vertex transitive graphs
- CORES OF SYMMETRIC GRAPHS
- Generalized symmetry of graphs - a survey
- The fine-grained complexity of graph homomorphism parameterized by clique-width
- Data exchange: semantics and query answering
- Graph homomorphisms via vector colorings
- Foundations of semantic web databases
- Path homomorphisms
- Maximal infinite-valued constraint languages
- Covers of Query Results
- Gibbs measures and dismantlable graphs
- Fine-grained complexity of the graph homomorphism problem for bounded-treewidth graphs
- Hyperconsistency width for constraint satisfaction: Algorithms and complexity results
- Dualities and dual pairs in Heyting algebras
- Cores of cubelike graphs
- Triangle-free graphs and forbidden subgraphs
- Minimum degree and the graph removal lemma
- Free adequate semigroups.
- Minimal universal and dense minor closed classes
- Testing the Complexity of a Valued CSP Language
- Conjunctive queries: unique characterizations and exact learnability
- scientific article; zbMATH DE number 434696 (Why is no real title available?)
- Homomorphisms and amalgamation
- Homomorphically full graphs
- Restricted chase termination for existential rules: a hierarchical approach and experimentation
- scientific article; zbMATH DE number 5030278 (Why is no real title available?)
- Convex-round graphs are circular-perfect
- SHACL validation in the presence of ontologies: semantics and rewriting techniques
- Minimal obstructions to C₅-Coloring in hereditary graph classes
- Removal lemmas and approximate homomorphisms
- The smallest hard trees
- Mixing homomorphisms, recolorings, and extending circular precolorings
- Schema mappings: a case of logical dynamics in database theory
- Generalized \(K\)-core percolation in networks with community structure
- New perspectives on semiring applications to dynamic programming
- Robust Factorizations and Colorings of Tensor Graphs
- Counting \(H-\)colorings of partial \(k-\)trees
- The complexity of equivalence, entailment, and minimization in existential positive logic
- A homotopy category for graphs
- On the complexity of existential positive queries
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
- Homomorphisms between graphs embedded in surfaces
- On the homomorphism order of labeled posets
- A more general theory of static approximations for conjunctive queries
- Towards tight bounds for the graph homomorphism problem parameterized by cutwidth via asymptotic matrix parameters
- A more general theory of static approximations for conjunctive queries
- An algorithmic framework for locally constrained homomorphisms
- A surprising permanence of old motivations (a not-so-rigid story)
- The good, the bad, and the great: homomorphisms and cores of random graphs
- A generalization of the Łoś-Tarski preservation theorem
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- Constructions of 3-Colorable Cores
- scientific article; zbMATH DE number 6866317 (Why is no real title available?)
- Equi-rank homomorphism preservation theorem on finite structures
- Complexity of tree homomorphisms
- Minimal obstructions to C₅-coloring in hereditary graph classes
- Relations between graphs
- Pretzel monoids
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- Commuting graph of an aperiodic Brandt semigroup
- \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's
- Shifts of the stable Kneser graphs and hom-idempotence
- Bare canonicity of representable cylindric and polyadic algebras
- Solutions and query rewriting in data exchange
- On the equivalence of distributed systems with queries and communication
This page was built for publication: The core of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686290)
