The reconstruction problem in graph theory
W. T. Tutte · British Polymer Journal · 1977
Abstract It is found that the chromatic and characteristic polynomials of a graph are reconstructible. This result is obtained by a process of reconstruction applied to partial results already in the literature.