Highly Influenced

# 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} }

- Published 1988 in Discrete Mathematics
DOI:10.1016/0012-365X(88)90232-4

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