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)- Hom complexes and homotopy theory in the category of graphs
- Homotopy groups of Hom complexes of graphs
- Dichotomy for bounded degree \(H\)-colouring
- Fall colouring of bipartite graphs and Cartesian products of graphs
- Proof of a conjecture concerning the direct product of bipartite graphs
- An oriented coloring of planar graphs with girth at least five
- Extension problems with degree bounds
- Homomorphisms and polynomial invariants of graphs
- Dualities in full homomorphisms
- A combinatorial constraint satisfaction problem dichotomy classification conjecture
- On colorings of graph powers
- Peek arc consistency
- Generalized symmetry of graphs - a survey
- Almost all graphs are rigid-revisited
- The good, the bad, and the great: homomorphisms and cores of random graphs
- Edge-switching homomorphisms of edge-coloured graphs
- An algorithm for the number of path homomorphisms
- The capture time of a graph
- On the complexity of H-colouring planar graphs
- The circular chromatic number of hypergraphs
- Homomorphisms of triangle-free graphs without a \(K_{5}\)-minor
- A generalization of the Erdős-Ko-Rado theorem
- Endomorphisms and cores of quadratic forms graphs in odd characteristic
- Binary covering arrays on tournaments
- On structure of cluster algebras of geometric type. I: In view of sub-seeds and seed homomorphisms
- Towards a characterization of universal categories
- On the \(b\)-continuity of the lexicographic product of graphs
- Reconfiguration in bounded bandwidth and tree-depth
- On the complexity of \(\mathbb{H}\)-coloring for special oriented trees
- Gaps in full homomorphism order
- Graph homomorphisms and components of quotient graphs
- Homomorphic preimages of geometric paths
- Retractions and homomorphisms on some operations of graphs
- The monotonicity property of \(M\)-partition problems
- Constants and finite unary relations in qualitative constraint reasoning
- On retracts, absolute retracts, and foldings in cographs
- Relating structure and power: comonadic semantics for computational resources (extended abstract)
- The fixed point property for ordered sets
- Aspects of structural combinatorics. (Graph homomorphisms and their use)
- On the Baer-Lovász-Tutte construction of groups from graphs: isomorphism types and homomorphism notions
- On rainbow-free colourings of uniform hypergraphs
- Homomorphism bounds and edge-colourings of \(K_{4}\)-minor-free graphs
- Oriented coloring on recursively defined digraphs
- The complexity of tropical graph homomorphisms
- Endomorphisms of quadratic forms graph in characteristic two
- Homomorphism order of connected monounary algebras
- A homotopy category for graphs
- The complexity of homomorphism factorization
- The analytic evolution of Dyson-Schwinger equations via homomorphism densities
- Duality pairs and homomorphisms to oriented and unoriented cycles
- Incidence hypergraphs: injectivity, uniformity, and matrix-tree theorems
- On list \(k\)-coloring convex bipartite graphs
- Describing hereditary properties by forbidden circular orderings
- List homomorphism problems for signed trees
- Unification of graphs and relations in Mizar
- Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\)
- Relation between graph of a lattice with respect to its ideals and corresponding adjacency matrix
- Complexity of correspondence \(H\)-colourings
- A hierarchy of dismantlings in graphs
- Representability of permutation representations on coalgebras and the isomorphism problem
- Approximating partition functions of bounded-degree Boolean counting constraint satisfaction problems
- Dismantlability, connectedness, and mixing in relational structures
- Superposition of snarks revisited
- Homomorphisms of signed graphs: an update
- Conjugation in semigroups.
- Dichotomy for tree-structured trigraph list homomorphism problems
- The \(C_{k}\)-extended graft construction
- Whither semantics?
- Finite ultrametric balls
- Subexponential algorithms for variants of the homomorphism problem in string graphs
- About graph mappings
- About vertex mappings
- Kirszbraun-type theorems for graphs
- A decidable dichotomy theorem on directed graph homomorphisms with non-negative weights
- All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
- Properties and morphisms of finite ultrametric spaces and their representing trees
- A note on the warmth of random graphs with given expected degrees
- Point determining digraphs, \(\{ 0,1 \}\)-matrix partitions, and dualities in full homomorphisms
- Locally constrained homomorphisms on graphs of bounded treewidth and bounded degree
- On maximum independent set of categorical product and ultimate categorical ratios of graphs
- Homomorphic image orders on combinatorial structures.
- Characterization of the finite C-MH-homogeneous graphs
- On well quasi-order of graph classes under homomorphic image orderings
- A note on independence complexes of chordal graphs and dismantling
- Homomorphism bounded classes of graphs
- Complexity issues on bounded restrictive H-coloring
- The complexity of signed graph and edge-coloured graph homomorphisms
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism
- On homomorphisms of oriented graphs with respect to the push operation
- Fractal property of the graph homomorphism order
- Decomposition of tournament limits
- On nice and injective-nice tournaments
- Correspondence homomorphisms to reflexive graphs
- Graph homomorphisms via vector colorings
- Majority constraints have bounded pathwidth duality
- Locally constrained graph homomorphisms and equitable partitions
- Generalised dualities and maximal finite antichains in the homomorphism order of relational structures
- A dichotomy for minimum cost graph homomorphisms
- On the adaptable chromatic number of graphs
- Forbidden lifts (NP and CSP for combinatorialists)
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)
