Timeline for Generalised de Bruijn Graph
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 26, 2012 at 2:29 | comment | added | Aaron Meyerowitz | Also, what is the question? A DeBruijn graph is a certain kind of graph. The big result is that it has a Hamilton cycle (or Euler cycle depending on the view) are you asking if that applies in your situation? | |
| May 25, 2012 at 23:30 | comment | added | Aaron Meyerowitz | Can you give an example or two of such a set S aside from all words of length $n$? If we restrict to the words of S with only 2 of the given letters that has the same properties so an example like that would be enough. | |
| May 25, 2012 at 14:41 | history | asked | user22882 | CC BY-SA 3.0 |