# Packing of graphs - a survey

```@article{Yap1988PackingOG,
title={Packing of graphs - a survey},
author={Hian Poh Yap},
journal={Discrete Mathematics},
year={1988},
volume={72},
pages={395-404}
}```
Suppose Gi, G2, . . . , Gk are graphs of order at most n. We say that there is a packing of Gi, G2, . . . , G, into the complete graph K,, if there exist injections q : V(G,)+ V(K,), i = 1, 2, . . . , k such that aT(E(Gi)) fl (Y/*(E(G~)) = \$ for i #j, where the map ar: : E(G,)-+ E(K,) . IS induced by a;. Similarly, suppose G is a graph of order m and H is a graph of order n 2 m and there exists an injection (Y: V(G)+ V(H) such that a*(E(G)) fl E(H) = \$, then we say that there is a packing of G… CONTINUE READING

#### Citations

##### Publications citing this paper.
Showing 1-10 of 32 extracted citations
1 Excerpt
1 Excerpt

#### References

##### Publications referenced by this paper.
Showing 1-10 of 16 references

## Applications of the uniformity lemma (invited lecture given at The First Japan

• E. Szemertdi
• Inter. Conf. on Graph Theory and Applications…
• 1986

## Some topics in graph theory (London Math. Sot

• H. P. Yap
• Lecture Note Series
• 1986

• S. Schuster
• 1985

## Packing and extremal digraphs

• A. P. Wojda, M. Wozniak
• Ars Combinatoria
• 1985

• C K. Teo
• 1985

## A note on the Erdos-Sbs conjecture

• Zhou Bing
• Acta Math. Sci
• 1984