# A Note on Uniquely Embeddable Forests

@inproceedings{Otfinowska2013ANO,
title={A Note on Uniquely Embeddable Forests},
author={Justyna Otfinowska and Mariusz Wozniak},
booktitle={Discuss. Math. Graph Theory},
year={2013}
}
• Published in Discuss. Math. Graph Theory 1 March 2013
• Mathematics
Abstract Let F be a forest of order n. It is well known that if F 6= Sn, a star of order n, then there exists an embedding of F into its complement F. In this note we consider a problem concerning the uniqueness of such an embedding.
1 Citations

## Figures from this paper

### A NOTE ON UNIQUELY EMBEDDABLE FORESTS 1

• Mathematics
• 2013
Let F be a forest of order n . It is well known that if F 6 = S n , a star of order n , then there exists an embedding of F into its complement F . In this note we consider a problem concerning the

## References

SHOWING 1-10 OF 20 REFERENCES

### A NOTE ON UNIQUELY EMBEDDABLE FORESTS 1

• Mathematics
• 2013
Let F be a forest of order n . It is well known that if F 6 = S n , a star of order n , then there exists an embedding of F into its complement F . In this note we consider a problem concerning the

### Every (p, p-2) graph is contained in its complement

• Mathematics
J. Graph Theory
• 1977
The following is proved: If G is graph of order p (≥2) and size p-2, then there exists an isomorphic embedding of G into its complement.

### Edge disjoint placement of graphs

• Mathematics
J. Comb. Theory, Ser. B
• 1978

### Packing of graphs—some recent results and trends

• Studies, Math. Series
• 2003

### Embedding (p,p−1) graphs in their complements

• Mathematics
• 1978
AbstractA graphG is embeddable in its complement $$\bar G$$ ifG is isomorphic with a subgraph of $$\bar G$$ . A complete characterization is given of those (p,p−1) graphs which are embeddable in