tandfonline.com har udgivet en rapport under søgningen “Teacher Education Mathematics”:
A graph G admits a graceful labeling if there is a one-to-one map f from the set of vertices of G to
such that when an edge xy is assigned the label
the resulting set of edge labels is
When such a labeling exists, G is called graceful. Rosa showed that a cycle Cn (
) is graceful if and only if n is congruent to 0 or 3 modulo 4. Truszczyński conjectured that unicyclic graphs, except the cycles in Rosa’s result are graceful. Several classes of unicyclic graphs are known to be graceful. In this article, we present a survey of results related to Truszczyński’s conjecture. We also present a new class of graceful unicyclic graphs.