1. ScholarBank@NUS
  2. 1. Staff
  3. Staff Publications
Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF01787731
DC FieldValue
dc.titlePacking two graphs of order n having total size at most 2 n - 2
dc.contributor.authorTeo, S.K.
dc.contributor.authorYap, H.P.
dc.date.accessioned2014-10-28T02:42:59Z
dc.date.available2014-10-28T02:42:59Z
dc.date.issued1990-06
dc.identifier.citationTeo, S.K., Yap, H.P. (1990-06). Packing two graphs of order n having total size at most 2 n - 2. Graphs and Combinatorics 6 (2) : 197-205. ScholarBank@NUS Repository. https://doi.org/10.1007/BF01787731
dc.identifier.issn09110119
dc.identifier.urihttp://scholarbank.nus.edu.sg/handle/10635/103909
dc.description.abstractTwo graphs G and H of the same order are packable if G can be embedded in the complement {Mathematical expression} of H. In this paper we give a complete characterization of two graphs of order n having total size at most 2 n - 2 which are packable. This result extends an earlier result of B. Bollobás and S.E. Eldridge. © 1990 Springer-Verlag.
dc.description.urihttp://libproxy1.nus.edu.sg/login?url=http://dx.doi.org/10.1007/BF01787731
dc.sourceScopus
dc.typeArticle
dc.contributor.departmentMATHEMATICS
dc.description.doi10.1007/BF01787731
dc.description.sourcetitleGraphs and Combinatorics
dc.description.volume6
dc.description.issue2
dc.description.page197-205
dc.identifier.isiutA1990EA78200010
Appears in Collections:Staff Publications

Show simple item record
Files in This Item:
There are no files associated with this item.

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.