# On graceful labelings of trees

Source: [On graceful labelings of trees](<https://www.sota2.com/research/paper/68fa57141e209131ce9a222e>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T14:31:44.072Z

Authors: Edinah K. Gnang

Published: 2018-11-19T11:10:20.000Z

## Abstract

We prove via a composition lemma, the Kotzig-Ringel-Rosa conjecture, better known as the Graceful Labeling Conjecture. We also prove via a stronger version of the composition lemma a stronger form of the Graceful Labeling Conjecture.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1811.07614>)

[PDF](<https://arxiv.org/pdf/1811.07614.pdf>)
