20 search results - page 1 / 4 » Long cycles and paths in distance graphs |
DM
2010
13 years 4 months ago
2010
DAM
2011
12 years 12 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
WG
2009
Springer
13 years 9 months ago
2009
Springer
CMOT
2004
13 years 4 months ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
EJC
2008
13 years 3 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...