Open AccessA note on uniquely embeddable graphs
Author(s) -
Mariusz Woźniak
Publication year - 1998
Publication title -
discussiones mathematicae graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.476
H-Index - 19
eISSN - 2083-5892
pISSN - 1234-3099
DOI - 10.7151/dmgt.1060
Subject(s) - mathematics , combinatorics , discrete mathematics
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.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom