86 search results - page 4 / 18 » Homomorphisms of 2-edge-colored graphs |
125
Voted
PVLDB
2010
15 years 2 months ago
2010
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional ...
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
97
Voted
JGT
2011
14 years 10 months ago
2011
154
Voted
SIAMDM
2008
15 years 3 months ago
2008
We introduce two variants of proper colorings with imposed partial ordering on the set of colors. One variant shows very close connections to some fundamental problems in graph the...
120
Voted
CSR
2008
Springer
15 years 5 months ago
2008
Springer
The universal cover TG of a connected graph G is the unique (possible infinite) tree covering G, i.e., that allows a locally bijective homomorphism from TG to G. Universal covers h...