The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Feng Ming Dong: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
    Chromatically Unique Multibridge Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  2. Feng Ming Dong, Khee Meng Koh
    Two Results on Real Zeros of Chromatic Polynomials. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:37, n:6, pp:809-813 [Journal]
  3. Feng Ming Dong
    The largest non-integer real zero of chromatic polynomials of graphs with fixed order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:103-112 [Journal]
  4. Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
    The vertex-cover polynomial of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:71-78 [Journal]
  5. Feng Ming Dong, Khee Meng Koh
    On upper bounds for real roots of chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:95-101 [Journal]
  6. Feng Ming Dong, Khee Meng Koh, C. A. Soh
    Divisibility of certain coefficients of the chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:311-317 [Journal]
  7. Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
    Chromatically unique bipartite graphs with low 3-independent partition numbers. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:224, n:1-3, pp:107-124 [Journal]
  8. Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
    An attempt to classify bipartite graphs by chromatic polynomials. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:73-88 [Journal]
  9. Feng Ming Dong, Kee L. Teo, Khee Meng Koh
    A note on the chromaticity of some 2-connected (n, n+3)-graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:243, n:1-3, pp:217-221 [Journal]
  10. Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
    Non-chordal graphs having integral-root chromatic polynomials II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:247-253 [Journal]
  11. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
    Chromaticity of some families of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:303-321 [Journal]
  12. Feng Ming Dong
    Proof of a Chromatic Polynomial Conjecture. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:78, n:1, pp:35-44 [Journal]
  13. Feng Ming Dong
    Bounds for mean colour numbers of graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:348-365 [Journal]
  14. F. M. Dong, K. M. Koh
    Structures and chromaticity of some extremal 3-colourable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:71-82 [Journal]
  15. F. M. Dong, K. M. Koh
    On the structure and chromaticity of graphs in which any two colour classes induce a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:176, n:1-3, pp:97-113 [Journal]
  16. F. M. Dong, K. M. Koh
    On graphs in which any pair of colour classes but one induces a tree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:169, n:1-3, pp:39-54 [Journal]
  17. Feng Ming Dong, Yanpei Liu
    On the chromatic uniqueness of the graph W(n, n-2) + Kk. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:145, n:1-3, pp:95-103 [Journal]
  18. Feng Ming Dong, Yanpei Liu
    Counting rooted near-triangulations on the sphere. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:123, n:1-3, pp:35-45 [Journal]

  19. Bounds For The Real Zeros of Chromatic Polynomials. [Citation Graph (, )][DBLP]


  20. On planar and non-planar graphs having no chromatic zeros in the interval (1, 2). [Citation Graph (, )][DBLP]


  21. The maximum number of maximal independent sets in unicyclic connected graphs. [Citation Graph (, )][DBLP]


  22. A maximal zero-free interval for chromatic polynomials of bipartite planar graphs. [Citation Graph (, )][DBLP]


  23. Domination numbers and zeros of chromatic polynomials. [Citation Graph (, )][DBLP]


Search in 0.017secs, Finished in 0.019secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002