7 search results - page 2 / 2 » Minimum cost homomorphisms to semicomplete multipartite digr... |
84
Voted
GC
2002
Springer
14 years 11 months ago
2002
Springer
An orientation of a digraph D is a spanning subdigraph of D obtained from D by deleting exactly one arc between x and y for every pair x = y of vertices such that both xy and yx a...
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...