(Under construction)
In the next pages, we give the results we have found for various graphs, grouped by type. We have found all graceful labellings of each graph considered (excluding symmetric equivalents), except where there are too many for it to be feasible (or interesting) to find them all, or where it was too time-consuming to find all solutions to the CSP.
Further results will be added as we find them.