SOME RESULTS ON RECONSTRUCTIBILITY OF COLORED GRAPHS
M. Dowd · International Journal of Pure and Apllied Mathematics · 2014
In an earlier paper the author has shown that a graph is reconstructible, except possibly if it has a single-block trunk.Here this result is shown for colored graphs.Some other results on colored graphs are given.In particular it is shown that reconstructibility is false for edge colored graphs.