9 search results - page 2 / 2 » On the extension of vertex maps to graph homomorphisms |
103
click to vote
CORR
2008
Springer
14 years 11 months ago
2008
Springer
This paper presents a method to find new De Bruijn cycles based on ones of lesser order. This is done by mapping a De Bruijn cycle to several vertex disjoint cycles in a De Bruijn ...
97
Voted
AAIM
2008
Springer
15 years 6 months ago
2008
Springer
For digraphs D and H, a mapping f : V (D)→V (H) is a homomorphism of D to H if uv ∈ A(D) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (D) is associated with co...
124
click to vote
GC
2010
Springer
14 years 10 months ago
2010
Springer
In 1988, Seiya Negami published a conjecture stating that a graph G has a finite planar cover (i.e. a homomorphism from some planar graph onto G which maps the vertex neighbourhoo...
147
click to vote
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Parallel applications based on irregular meshes make use of mesh partitioners for efficient execution. Some mesh partitioners can map a mesh to a heterogeneous computational plat...