553 search results - page 11 / 111 » Cover Contact Graphs |
CSR
2008
Springer
14 years 12 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...
132
click to vote
ICALP
2011
Springer
14 years 1 months ago
2011
Springer
In [13], Erd˝os et al. defined the local chromatic number of a graph as the minimum number of colors that must appear within distance 1 of a vertex. For any ∆ ≥ 2, there are ...
94
Voted
SIROCCO
2001
14 years 11 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
ECEASST
2010
14 years 7 months ago
2010
d Abstract) Detlef Plump Abstract. In general, it is undecidable whether a terminating graphtransformation system is confluent or not. We introduce the class of coverable hypergrap...