IJPAM: Volume 108, No. 2 (2016)

A VARIANT OF RECONSTRUCTIBILITY
OF COLORED GRAPHS

Martin Dowd
1613 Wintergreen Pl.
Costa Mesa, CA 92626, USA

Abstract. A variant of reconstructibility of colored graphs is defined, and some facts proved. Some computational facts from an earlier paper are revised.

Received: February 29, 2016

Revised: February 29, 2016

Published: October 1, 2016

AMS Subject Classification: 05C60

Key Words and Phrases: colored graph reconstructibility
Download paper from here.

Bibliography

1
J. A. Bondy and R. L. Hemminger,Graph reconstruction - a survey,J. Graph Theory 1 (1977), 227-268.://dx.doi.org/10.1002

.




DOI: 10.12732/ijpam.v108i2.20 How to cite this paper?

Source:
International Journal of Pure and Applied Mathematics
ISSN printed version: 1311-8080
ISSN on-line version: 1314-3395
Year: 2016
Volume: 108
Issue: 2
Pages: 477 - 482


Google Scholar; DOI (International DOI Foundation); WorldCAT.

CC BY This work is licensed under the Creative Commons Attribution International License (CC BY).