Skip navigation
NIE Home
Library Home
Deposit@NIE
Home
Browse
Communities & Collections
Browse Items by:
Issue Date
Author
Title
Subject
Researchers
Help
FAQ
Sign on to:
My DSpace
Receive email
updates
Edit Profile
Advanced Search
Sign on to:
My DSpace
Receive email
updates
Edit Profile
NIE Digital Repository
Research Outputs
Browsing by Author
Dong Fengming
Enter a last name
Or, select a letter below to browse by last name
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 20 of 44
next >
RefMan
EndNote
BibTeX
RefWorks
Excel
CSV
Issue Date
Title
Author(s)
2022
Anti-Ramsey numbers for trees in complete multi-partite graphs
Zhang, Meiqiao
;
Dong, F. M.
Nov-2008
Bounds for the real zeros of chromatic polynomials
Dong, F. M.
;
Koh, Khee Meng
2012
A characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
Koh, Khee Meng
;
Ting, T. S.
;
Dong, F. M.
2011
Chromatic roots of a ring of four cliques
Dong, F. M.
;
Royle, Gordon
;
Wagner, Dave
2004
Chromatically unique multibridge graphs
Dong, F. M.
;
Teo, Kee Leong
;
Little, Charles H. C.
;
Hendy, Michael
;
Koh, Khee Meng
2022
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Dong, F. M.
;
Ge, Jun
2021
DP color functions versus chromatic polynomials
Dong, F. M.
;
Yang, Yan
2022
Express the number of spanning trees in term of degrees
Dong, F. M.
;
Ge, Jun
;
Ouyang, Zhangdong
2018
From G-parking functions to B-parking functions
Dong, F. M.
2004
Graph-functions associated with an edge-property
Dong, F. M.
;
Hendy, Michael
;
Teo, Kee Leong
;
Little, Charles H. C.
Mar-2023
An improved lower bound of P (G, L) - P (G, k) for k - assignments L
Dong, F. M.
;
Zhang, Meiqiao
2010
Lower bound on the weakly connected domination number of a cycledisjoint graph
Koh, Khee Meng
;
Ting, T. S.
;
Xu, Z. L.
;
Dong, F. M.
May-2006
Mathematical problem solving for integrated programme students
Tay, Eng Guan
;
Quek, Khiok Seng
;
Dong, F. M.
;
Lee, Tuo Yeong
;
Lim-Teo, Suat Khoh
;
Toh, Tin Lam
;
Ho, Foo Him
2021
The maximal 1-planarity and crossing numbers of graphs
Ouyang, Zhangdong
;
Huang, Yuanqiu
;
Dong, F. M.
2019
New expressions for order polynomials and chromatic polynomials
Dong, F. M.
2022
New upper bounds for the crossing numbers of crossing-critical graphs
Ding, Zhongpeng
;
Ouyang, Zhangdong
;
Huang, Yuanqiu
;
Dong, F. M.
2017
A note on distance spectral radius of trees
Wang, Yanna
;
Xing, Rundan
;
Zhou, Bo
;
Dong, F. M.
2006
On graphs having no chromatic zeros in (1, 2)
Dong, F. M.
;
Koh, Khee Meng
2015
On graphs having no flow roots in the Interval (1, 2)
Dong, F. M.
2018
On graphs whose flow polynomials have real roots only
Dong, F. M.