Please use this identifier to cite or link to this item: https://doi.org/10.1007/BF01787731
Title: Packing two graphs of order n having total size at most 2 n - 2
Authors: Teo, S.K.
Yap, H.P. 
Issue Date: Jun-1990
Source: Teo, 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
Abstract: Two 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.
Source Title: Graphs and Combinatorics
URI: http://scholarbank.nus.edu.sg/handle/10635/103909
ISSN: 09110119
DOI: 10.1007/BF01787731
Appears in Collections:Staff Publications

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

SCOPUSTM   
Citations

3
checked on Feb 21, 2018

WEB OF SCIENCETM
Citations

3
checked on Jan 15, 2018

Page view(s)

29
checked on Feb 25, 2018

Google ScholarTM

Check

Altmetric


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