How can one count the number of graceful labelings of a path graph?
Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)
|
2
|
|||||||||
|
|
2
|
An efficient algorithm is described in a paper by Michael Adamaszek which is powerful enough to count the number of graceful labelings of paths up to length 40. It concludes: "It also remains an open question to find an exponential upper bound on [the number of graceful labelings of paths of length n]" |
|||
|
