Browse by Journal Title
 | Up a level |
Number of items: 6.
C
Chen, C.C. and Koh, K.M. and Peng, Y.H.
(1993)
On the higher-order edge toughness of a graph.
Discrete Mathematics, 111 (1-3).
pp. 113-123.
ISSN 0012-365X; eISSN: 0012-365X
L
Lau, G. C. and Peng, Y. H.
(2008)
On the chromaticity of complete multipartite graphs with certain edges added.
Discrete Mathematics, 309 (12).
pp. 4089-4094.
ISSN 0012-365X
O
Omoomi, Behnaz and Peng, Yee-Hock
(2003)
Chromatic equivalence classes of certain generalized polygon trees, III.
Discrete Mathematics, 271.
pp. 223-234.
ISSN 0012-365X
Omoomi, Behnaz and Peng, Yee-Hock
(2001)
Chromatic equivalence classes of certain cycles with edges.
Discrete Mathematics, 232 (1-3).
pp. 175-183.
ISSN 0012-365X; eISSN: 0012-365X
P
Peng, Yee Hock and Little, Charles H. C. and Teo, Kee Leong and Wang, H.
(1997)
Chromatic equivalence classes of certain generalized polygon trees.
Discrete Mathematics, 172 (1-3).
pp. 103-114.
ISSN 0012-365X
Peng, Y.H.
(1991)
On the chromatic uniqueness of certain bipartite graphs.
Discrete Mathematics, 94 (2).
pp. 129-140.
ISSN 0012-365X; eISSN: 0012-365X