202 search results - page 3 / 41 » Locally identifying coloring of graphs |
JCT
2002
13 years 8 months ago
2002
It is proved that there is a function f : N N such that the following holds. Let G be a graph embedded in a surface of Euler genus g with all faces of even size and with edge-wid...
GC
2006
Springer
13 years 8 months ago
2006
Springer
SIAMCOMP
2010
13 years 7 months ago
2010
TCS
2011
13 years 3 months ago
2011
IPL
2007
13 years 8 months ago
2007
We study the approximability and inapproximability of finding identifying codes and locating-dominating codes of the minimum size. In general graphs, we show that it is possible ...