scientific article; zbMATH DE number 2117181
From MaRDI portal
Recommendations
- Graph homomorphisms
- scientific article; zbMATH DE number 93767
- scientific article; zbMATH DE number 861321
- Homomorphism theorems for graphs
- Homomorphism-homogeneous graphs
- scientific article; zbMATH DE number 1054727
- Homology theory of graphs
- Graphs of morphisms of graphs
- Graphs of morphisms of graphs
- Complexes of graph homomorphisms
Cited in
(only showing first 100 items - show all)- Constructing uniquely realizable graphs
- Graphs with convex balls
- Homomorphisms and Polynomial Invariants of Graphs
- In praise of homomorphisms
- On cylindrical graph construction and its applications
- Quantum homomorphisms
- Labeled posets are universal
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
- Chromatic numbers and products
- A framework for comparing query languages in their ability to express Boolean queries
- Kirszbraun-type theorems for graphs
- Fractal networks: topology, dimension, and complexity
- On unretractive graphs
- Almost all graphs are rigid-revisited
- Hedetniemi's conjecture and adjoint functors in thin categories
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- A graph-theoretic condition for delay stability of reaction systems
- On retracts, absolute retracts, and foldings in cographs
- Matrix partitions of perfect graphs
- A note on independence complexes of chordal graphs and dismantling
- Homomorphisms of 2-edge-colored graphs
- Finite duality for some minor closed classes
- On Finite Maximal Antichains in the Homomorphism Order
- On realizations of point determining graphs, and obstructions to full homomorphisms
- The fixed point property for ordered sets
- Homomorphisms of signed graphs: an update
- Graph partitions with prescribed patterns
- Dismantlability, Connectedness, and Mixing in Relational Structures
- Retracting Graphs to Cycles
- scientific article; zbMATH DE number 861321 (Why is no real title available?)
- Join colourings of chordal graphs
- The complexity of surjective homomorphism problems-a survey
- Zero divisors among digraphs
- Retractions and homomorphisms on some operations of graphs
- Extended Gallai's theorem
- Odd-angulated graphs and cancelling factors in box products
- CSP dichotomy for special triads
- Homomorphisms of random paths
- The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops
- A quasicancellation property for the direct product of graphs
- List homomorphism problems for signed trees
- Unification of graphs and relations in Mizar
- Comparing Universal Covers in Polynomial Time
- Guarding isometric subgraphs and cops and robber in planar graphs
- Generalisations of matrix partitions: complexity and obstructions
- Dismantlability, connectedness, and mixing in relational structures
- Unifying the three algebraic approaches to the CSP via minimal Taylor algebras
- Decomposition of tournament limits
- Adjacency preservers on invertible Hermitian matrices. I.
- The quest for a characterization of hom-properties of finite character
- A note on the warmth of random graphs with given expected degrees
- scientific article; zbMATH DE number 7525468 (Why is no real title available?)
- Dismantlability of weakly systolic complexes and applications
- Finding Large $H$-Colorable Subgraphs in Hereditary Graph Classes
- On prisms, Möbius ladders and the cycle space of dense graphs
- Superposition of snarks revisited
- On the Complexity of Reconstructing H-free Graphs from Their Star Systems
- Functors on relational structures which admit both left and right adjoints
- Adjacency preservers, symmetric matrices, and cores
- On homomorphisms of oriented graphs with respect to the push operation
- Colouring, constraint satisfaction, and complexity
- Products of unit distance graphs
- scientific article; zbMATH DE number 7559391 (Why is no real title available?)
- The complexity of locally injective homomorphisms
- Generalized symmetry of graphs - a survey
- On the complexity of \(H\)-colouring planar graphs
- Minimum Cost Homomorphism Dichotomy for Oriented Cycles
- Beyond symmetry in generalized Petersen graphs
- The complexity of weighted Boolean \#CSP with mixed signs
- Homomorphisms and colourings of oriented graphs: an updated survey
- Neighborhood complexes of some exponential graphs
- Perfect codes in direct products of cycles
- The quantum monad on relational structures
- Minimum cost homomorphisms to semicomplete multipartite digraphs
- Graph homomorphisms via vector colorings
- Orthogonal tree decompositions of graphs
- On structure of cluster algebras of geometric type. I: In view of sub-seeds and seed homomorphisms
- The monotonicity property of \(M\)-partition problems
- Convex circuit-free coloration of an oriented graph
- On the sum-max graph partitioning problem
- scientific article; zbMATH DE number 7561584 (Why is no real title available?)
- Tension continuous maps -- their structure and applications
- scientific article; zbMATH DE number 7359806 (Why is no real title available?)
- The capture time of a graph
- Connectedness of certain graph coloring complexes
- Foldings in graphs and relations with simplicial complexes and posets
- Min orderings and list homomorphism dichotomies for graphs and signed graphs
- An algorithmic framework for locally constrained homomorphisms
- Graph homomorphisms and nodal domains
- When is a random graph projective?
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms
- An algorithm for the number of path homomorphisms
- Graph homomorphisms, the tutte polynomial and ``\(q\)-state Potts uniqueness
- Computing role assignments of split graphs
- Bounds for visual cryptography schemes
- Maximum \(H\)-colourable subdigraphs and constraint optimization with arbitrary weights
- A Hopf algebra on subgraphs of a graph
- Constants and finite unary relations in qualitative constraint reasoning
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4828516)
