Results 81 to 90 of about 238 (165)

Correspondence Homomorphisms to Reflexive Graphs

open access: yesElectronic Notes in Discrete Mathematics, 2017
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

open access: yesДоповiдi Нацiональної академiї наук України
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

Distinguishing homomorphisms of infinite graphs

open access: yesContributions to Discrete Mathematics, 2012
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

Locally common graphs. [PDF]

open access: yesJ Graph Theory, 2023
Csóka E, Hubai T, Lovász L.
europepmc   +1 more source

Universal Causality. [PDF]

open access: yesEntropy (Basel), 2023
Mahadevan S.
europepmc   +1 more source

Home - About - Disclaimer - Privacy