A note on uniquely embeddable graphs
Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 15-21
Voir la notice de l'article provenant de la source Library of Science
Let G be a simple graph of order n and size e(G). It is well known that if e(G) ≤ n-2, then there is an embedding G into its complement [G̅]. In this note, we consider a problem concerning the uniqueness of such an embedding.
Keywords:
packing of graphs
@article{DMGT_1998_18_1_a1,
author = {Wo\'zniak, Mariusz},
title = {A note on uniquely embeddable graphs},
journal = {Discussiones Mathematicae. Graph Theory},
pages = {15--21},
publisher = {mathdoc},
volume = {18},
number = {1},
year = {1998},
language = {en},
url = {http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a1/}
}
Woźniak, Mariusz. A note on uniquely embeddable graphs. Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 15-21. http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a1/