17 search results - page 2 / 4 » On 2-Detour Subgraphs of the Hypercube |
JGT
2008
15 years 1 months ago
2008
A spanning subgraph G of a graph H is a k-detour subgraph of H if for each pair of vertices x, y V (H), the distance, distG(x, y), between x and y in G exceeds that in H by at mo...
104
click to vote
EJC
1998
15 years 1 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...
97
Voted
APPML
2006
15 years 1 months ago
2006
106
click to vote
JGT
2006
15 years 1 months ago
2006
We prove that for every fixed k and 5 and for sufficiently large n, every edge coloring of the hypercube Qn with k colors contains a monochromatic cycle of length 2 . This answer...
106
click to vote
IWOCA
2009
Springer
15 years 8 months ago
2009
Springer
An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive int...