Packing two graphs of order n having total size at most 2 n - 2

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
Citation:	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

There are no files associated with this item.

Check