Results 81 to 90 of about 238 (165)
Correspondence Homomorphisms to Reflexive Graphs
Abstract Correspondence homomorphisms are a common generalization of homomorphisms and of correspondence colourings. For a fixed reflexive target graph H, the problem is to decide whether an input graph G, with each edge labeled by a pair of permutations of V(H), admits a homomorphism to H ‘corresponding’ to the labels.
Tomás Feder, Pavol Hell
openaire +1 more source
On new symbolic key exchange protocols and cryptosystems based on a hidden tame homomorphism
Multivariate cryptosystems are divided into public rules, for which tools of encryption are open for users and systems of the El Gamal type, for which the encryption function is not given in public, and, for its generation, the opponent has to solve a ...
V.A. Ustimenko
doaj +1 more source
Graphic Groups, Graph Homomorphisms, and Graphic Group Lattices in Asymmetric Topology Cryptography. [PDF]
Zhao M, Wang H, Yao B.
europepmc +1 more source
Distinguishing homomorphisms of infinite graphs
We supply an upper bound on the distinguishing chromatic number of certain infinite graphs satisfying an adjacency property. Distinguishing proper n-colourings are generalized to the new notion of distinguishing homomorphisms. We prove that if a graph G satisfies the connected existentially closed property and admits a homomorphism to H, then it admits
Anthony Bonato, Dejan Delic
openaire +2 more sources
What is category theory to cognitive science? Compositional representation and comparison. [PDF]
Phillips S.
europepmc +1 more source
Faster algorithms for counting subgraphs in sparse graphs. [PDF]
Bressan M.
europepmc +1 more source
On the Non-Adaptive Zero-Error Capacity of the Discrete Memoryless Two-Way Channel. [PDF]
Gu Y, Shayevitz O.
europepmc +1 more source
Algebras, Graphs and Ordered Sets - ALGOS 2020 & the Mathematical Contributions of Maurice Pouzet. [PDF]
Couceiro M, Duffus D.
europepmc +1 more source

