%0 Journal Article %1 journals/gc/TeoY90 %A Teo, S. K. %A Yap, H. P. %D 1990 %J Graphs and Combinatorics %K dblp %N 2 %P 197-205 %T Packing two graphs of ordern having total size at most 2n - 2. %U http://dblp.uni-trier.de/db/journals/gc/gc6.html#TeoY90 %V 6

@article{journals/gc/TeoY90, added-at = {2012-04-29T00:00:00.000+0200}, author = {Teo, S. K. and Yap, H. P.}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/2561e1d540c6c6b51ba5a77dfe3a02b3f/dblp}, ee = {http://dx.doi.org/10.1007/BF01787731}, interhash = {0b1fb76f962a93eb65745efc8069357f}, intrahash = {561e1d540c6c6b51ba5a77dfe3a02b3f}, journal = {Graphs and Combinatorics}, keywords = {dblp}, number = 2, pages = {197-205}, timestamp = {2016-02-02T05:35:02.000+0100}, title = {Packing two graphs of ordern having total size at most 2n - 2.}, url = {http://dblp.uni-trier.de/db/journals/gc/gc6.html#TeoY90}, volume = 6, year = 1990 }