A Computational Approach to the Graceful Tree Conjecture
Discrete Mathematics
2010-08-20 v2 Combinatorics
Abstract
Graceful tree conjecture is a well-known open problem in graph theory. Here we present a computational approach to this conjecture. An algorithm for finding graceful labelling for trees is proposed. With this algorithm, we show that every tree with at most 35 vertices allows a graceful labelling, hence we verify that the graceful tree conjecture is correct for trees with at most 35 vertices.
Keywords
Cite
@article{arxiv.1003.3045,
title = {A Computational Approach to the Graceful Tree Conjecture},
author = {Wenjie Fang},
journal= {arXiv preprint arXiv:1003.3045},
year = {2010}
}
Comments
7 pages