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

10.1007/BF01787731

Saved in:

Bibliographic Details
Main Authors:	Teo, S.K., Yap, H.P.
Other Authors:	MATHEMATICS
Format:	Article
Published:	2014
Online Access:	http://scholarbank.nus.edu.sg/handle/10635/103909
Tags:	Add Tag No Tags, Be the first to tag this record!
Institution:	National University of Singapore

id	sg-nus-scholar.10635-103909
record_format	dspace
spelling	sg-nus-scholar.10635-1039092023-10-30T20:43:34Z Packing two graphs of order n having total size at most 2 n - 2 Teo, S.K. Yap, H.P. MATHEMATICS 10.1007/BF01787731 Graphs and Combinatorics 6 2 197-205 2014-10-28T02:42:59Z 2014-10-28T02:42:59Z 1990-06 Article 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 09110119 http://scholarbank.nus.edu.sg/handle/10635/103909 A1990EA78200010 Scopus
institution	National University of Singapore
building	NUS Library
continent	Asia
country	Singapore Singapore
content_provider	NUS Library
collection	ScholarBank@NUS
description	10.1007/BF01787731
author2	MATHEMATICS
author_facet	MATHEMATICS Teo, S.K. Yap, H.P.
format	Article
author	Teo, S.K. Yap, H.P.
spellingShingle	Teo, S.K. Yap, H.P. Packing two graphs of order n having total size at most 2 n - 2
author_sort	Teo, S.K.
title	Packing two graphs of order n having total size at most 2 n - 2
title_short	Packing two graphs of order n having total size at most 2 n - 2
title_full	Packing two graphs of order n having total size at most 2 n - 2
title_fullStr	Packing two graphs of order n having total size at most 2 n - 2
title_full_unstemmed	Packing two graphs of order n having total size at most 2 n - 2
title_sort	packing two graphs of order n having total size at most 2 n - 2
publishDate	2014
url	http://scholarbank.nus.edu.sg/handle/10635/103909
_version_	1781787792860250112

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

Similar Items