The core of a graph
From MaRDI portal
Publication:686290
DOI10.1016/0012-365X(92)90282-KzbMATH Open0803.68080OpenAlexW2073279331MaRDI QIDQ686290FDOQ686290
Publication date: 14 October 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90282-k
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
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75)
Cites Work
- Matching theory
- On the complexity of H-coloring
- Color-families are dense
- Minimum node covers and 2-bicritical graphs
- Chromatically optimal rigid graphs
- Title not available (Why is that?)
- Fixed-edge theorem for graphs with loops
- The Complexity of Colouring by Semicomplete Digraphs
- Title not available (Why is that?)
- The effect of two cycles on the complexity of colourings by directed graphs
- Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)
- On minimal graphs
- Endomorphisms of graphs. II: Various unretractive graphs
- Unretractive and S-unretractive joins and lexicographic products of graphs
- Cohomomorphisms of graphs and hypergraphs
- Title not available (Why is that?)
Cited In (65)
- Chromatic numbers and products
- How many variables are needed to express an existential positive query?
- The complexity of restricted graph homomorphisms
- On retracts, absolute retracts, and foldings in cographs
- Restricted Chase Termination for Existential Rules: A Hierarchical Approach and Experimentation
- Title not available (Why is that?)
- Fine-Grained Complexity of the Graph Homomorphism Problem for Bounded-Treewidth Graphs
- Graph homomorphisms with infinite targets
- FREE ADEQUATE SEMIGROUPS
- On the data complexity of consistent query answering
- Testing subgraphs in directed graphs
- Conjunctive query evaluation by search-tree revisited
- Generalized K-Core Percolation in Networks with Community Structure
- Enumerating homomorphisms
- Colouring, constraint satisfaction, and complexity
- Generalized symmetry of graphs - a survey
- Graph homomorphisms via vector colorings
- Data exchange: semantics and query answering
- A More General Theory of Static Approximations for Conjunctive Queries
- Path homomorphisms
- Foundations of semantic web databases
- Maximal infinite-valued constraint languages
- Covers of Query Results
- Preserving Constraints with the Stable Chase
- Gibbs measures and dismantlable graphs
- RESIDUAL PROPERTIES OF SIMPLE GRAPHS
- Dualities and dual pairs in Heyting algebras
- Minimum degree and the graph removal lemma
- Triangle-free graphs and forbidden subgraphs
- Testing the Complexity of a Valued CSP Language
- Minimal universal and dense minor closed classes
- Title not available (Why is that?)
- Title not available (Why is that?)
- Homomorphisms and amalgamation
- Homomorphically full graphs
- Removal lemmas and approximate homomorphisms
- Convex-round graphs are circular-perfect
- On the complexity of existential positive queries
- 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 homomorphism order of labeled posets
- A more general theory of static approximations for conjunctive queries
- A surprising permanence of old motivations (a not-so-rigid story)
- CoReS: a tool for computing core graphs via SAT/SMT solvers
- Constructions of 3-Colorable Cores
- A generalization of the Łoś-Tarski preservation theorem
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- Title not available (Why is that?)
- HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results
- Complexity of tree homomorphisms
- The Complexity of General-Valued Constraint Satisfaction Problems Seen from the Other Side
- Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings
- 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
- Schema Mappings: A Case of Logical Dynamics in Database Theory
- The smallest hard trees
- Robust Factorizations and Colorings of Tensor Graphs
- Security Protocol Analysis in Context: Computing Minimal Executions Using SMT and CPSA
- Homomorphisms between graphs embedded in surfaces
- An algorithmic framework for locally constrained homomorphisms
- \((\mathbb{Z},\mathrm{succ},U)\), \((\mathbb{Z},E,U)\), and their CSP's
- Arboreal categories and equi-resource homomorphism preservation theorems
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)
