IJPAM: Volume 95, No. 2 (2014)
OF COLORED GRAPHS
1613 Wintergreen Pl.
Costa Mesa, CA 92626, USA
Abstract. 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.
Received: July 17, 2014
AMS Subject Classification: 05C60
Key Words and Phrases: colored graph reconstructibility
Download paper from here.
DOI: 10.12732/ijpam.v95i2.14 How to cite this paper?
Source: International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Pages: 309 - 321