Packing two graphs of order n having total size at most 2 n - 2
10.1007/BF01787731
Saved in:
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 |
Similar Items
-
On the Size of Graphs of Class 2 Whose Cores have Maximum Degree Two
by: Koh, K.M., et al.
Published: (2014) -
Packing of Graphs-A Survey
by: Yap, H.P.
Published: (2014) -
Packing of graphs-a survey
by: Yap, H.P.
Published: (2014) -
Chromatic classes of 2-connected (n, n + 3)-graphs with at least two triangles
by: Koh, K.M., et al.
Published: (2014) -
Generalization of two results of Hilton on total-colourings of a graph
by: Yap, H.P.
Published: (2014)