The following pages link to (Q4828516):
Displaying 50 items.
- On cylindrical graph construction and its applications (Q252833) (← links)
- Quantum homomorphisms (Q257001) (← links)
- Distance constraint satisfaction problems (Q259047) (← links)
- Adjacency preservers on invertible Hermitian matrices. I. (Q269533) (← links)
- The quest for a characterization of hom-properties of finite character (Q274710) (← links)
- Homomorphisms and colourings of oriented graphs: an updated survey (Q279228) (← links)
- Neighborhood complexes of some exponential graphs (Q286102) (← links)
- Computing role assignments of split graphs (Q287443) (← links)
- Nerve complexes of circular arcs (Q312133) (← links)
- Counting \(4 \times 4\) matrix partitions of graphs (Q313799) (← links)
- An universality argument for graph homomorphisms (Q322345) (← links)
- Semigroup theory of symmetry (Q338184) (← links)
- Square-free graphs are multiplicative (Q345100) (← links)
- Generalised Mycielski graphs, signature systems, and bounds on chromatic numbers (Q345126) (← links)
- Local properties of simplicial complexes (Q367421) (← links)
- Obstructions to partitions of chordal graphs (Q383740) (← links)
- Noncommutative Riemannian geometry on graphs (Q387267) (← links)
- Solutions and query rewriting in data exchange (Q388220) (← links)
- Constructing uniquely realizable graphs (Q393739) (← links)
- Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms (Q415269) (← links)
- Adjacency preservers, symmetric matrices, and cores (Q424391) (← links)
- Tension continuous maps -- their structure and applications (Q427807) (← links)
- Acyclic homomorphisms to stars of graph Cartesian products and chordal bipartite graphs (Q432716) (← links)
- Reflexive digraphs with near unanimity polymorphisms (Q442320) (← links)
- Foldings in graphs and relations with simplicial complexes and posets (Q442383) (← links)
- The complexity of surjective homomorphism problems-a survey (Q444433) (← links)
- \(H\)-colorings of dense hypergraphs (Q456171) (← links)
- Locally constrained graph homomorphisms -- structure, complexity, and applications (Q458463) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Digraph functors which admit both left and right adjoints (Q488275) (← links)
- On spaces extremal for the Gomory-Hu inequality (Q498716) (← links)
- On three measures of non-convexity (Q522338) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Cops and robbers from a distance (Q604465) (← links)
- Maltsev digraphs have a majority polymorphism (Q627926) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- Distinguishing graphs by their left and right homomorphism profiles (Q648964) (← links)
- Embedding dualities for set partitions and for relational structures (Q648966) (← links)
- Extending precolourings of circular cliques (Q658016) (← links)
- On the sandpile group of the cone of a graph (Q665936) (← links)
- Hedetniemi's conjecture and adjoint functors in thin categories (Q682072) (← links)
- Acyclic 3-choosability of sparse graphs with girth at least 7 (Q708400) (← links)
- The complexity of colouring by locally semicomplete digraphs (Q709314) (← links)
- The complexity of locally injective homomorphisms (Q709315) (← links)
- Acyclic 4-choosability of planar graphs with neither 4-cycles nor triangular 6-cycles (Q710596) (← links)
- Minors of Boolean functions with respect to clique functions and hypergraph homomorphisms (Q710720) (← links)
- Acyclic 4-choosability of planar graphs without adjacent short cycles (Q713156) (← links)
- Computing vertex-surjective homomorphisms to partially reflexive trees (Q714844) (← links)
- The homomorphism lattice induced by a finite algebra (Q722581) (← links)
- Universality of intervals of line graph order (Q740276) (← links)
