Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Dong, F.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The 3-connectivity of a graph and the multiplicity of zero ``2'' of its chromatic polynomial
F.M. Dong
,
K.M. Koh
Journal of Graph Theory
70
(3), 2012, pp. 262-283
A zero-free interval for chromatic polynomials of nearly 3-connected plane graphs
F.M. Dong
,
Bill Jackson
SIAM Journal on Discrete Mathematics
25
(3), 2011, pp. 1103-1118
On zero-free intervals in (1,2) of chromatic polynomials of some families of graphs
F.M. Dong
,
K.M. Koh
SIAM Journal on Discrete Mathematics
24
(2), 2010, pp. 370-378
Bounds for the coefficients of flow polynomials
F.M. Dong
,
K.M. Koh
Journal of Combinatorial Theory Series B
97
(3), 2007, pp. 413-420
On graphs having no chromatic zeros in (1,2)
F.M. Dong
,
K.M. Koh
SIAM Journal on Discrete Mathematics
20
(3), 2006, pp. 799-810
Further results on the lower bounds of mean color numbers
F.M. Dong
Journal of Graph Theory
48
(1), 2005, pp. 51-73
Bounds for mean colour numbers of graphs
F.M. Dong
Journal of Combinatorial Theory Series B
87
(2), 2003, pp. 348-365
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs
F.M. Dong
,
K.M. Koh
,
K.L. Teo
,
C.H.C. Little
,
M.D. Hendy
Journal of Graph Theory
(1), 2001, pp. 48-77
Proof of a chromatic polynomial conjecture
F.M. Dong
Journal of Combinatorial Theory Series B
78
(1), 2000, pp. 35-44
On the chromatic uniqueness of the graph
W(n,n-2,k)
F.M. Dong
,
Y.P. Liu
Graphs and Combinatorics
12
, 1996, pp. 221-230
Structures and chromaticity of extremal 3-colourable sparse graphs
F.M. Dong
,
K.M. Koh
,
K.L. Teo
Graphs and Combinatorics
17
(4), pp. 611-635