Graph homomorphism

Known as: Digraph morphism, Graph monomorphism, Graph morphism 
In the mathematical field of graph theory a graph homomorphism is a mapping between two graphs that respects their structure. More concretely it maps… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
For a fixed graph $H$, the reconfiguration problem for $H$-colourings (i.e. homomorphisms to $H$) asks: given a graph $G$ and two… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
Given a graph G, we investigate the question of determining the parity of the number of homomorphisms from G to some other fixed… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
2015
2015
The graph homomorphism problem (HOM) asks whether the vertices of a given n-vertex graph G can be mapped to the vertices of a… (More)
Is this relevant?
2014
2014
In this work, we study the problem of index coding from graph homomorphism perspective. We show that the minimum broadcast rate… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
In a variety of emerging applications one needs to decide whether a graphG matchesanotherGp, i.e., whetherG has a topological… (More)
  • figure 1
  • table 1
  • table 2
  • figure 5
  • figure 7
Is this relevant?
2010
2010
A homomorphism from a graph G to a graph H (in this paper, both simple, undirected graphs) is a mapping f:V(G)→V(H) such that if… (More)
Is this relevant?
2008
2008
We study restricted homomorphism dualities in the context of classes with bounded expansion (which are defined by means of the… (More)
Is this relevant?
2006
2006
We introduce the maximum graph homomorphism (MGH) problem: given a graph G, and a target graph H, find a mapping φ : VG 7→ VH… (More)
Is this relevant?
2006
2006
We prove that in the List version, the problem of deciding the existence of a locally injective homomorphism to a parameter graph… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2005
2005
Semantic consequence (entailment) in RDF is ususally computed using Pat Hayes Interpolation Lemma. In this paper, we reformulate… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?