Abstract
Publisher Summary In the study of embedding of a graph into another graph, usually at least, one of the two graphs is fixed whereas in the study of packing of two graphs very often both the graphs are arbitrarily chosen from certain classes of graphs. This paper focuses on some results on the following two packing problems. The first one is on dense packings of trees of different sizes into Kn. The second one is on general packings of two graphs having small size. Some open problems in this area are also mentioned.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
