The SCEAS System
Navigation Menu

Search the dblp DataBase


Zemin Jin: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Zemin Jin, Huifang Yan, Qinglin Yu
    Generalization of matching extensions in graphs (II). [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:10, pp:1267-1274 [Journal]
  2. Xiaolong Huang, Zemin Jin, Xingxing Yu, Xiaoyan Zhang
    Contractible Cliques in k-Connected Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2006, v:22, n:3, pp:361-370 [Journal]
  3. Zemin Jin, Xueliang Li
    The complexity for partitioning graphs by monochromatic trees, cycles and paths. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2004, v:81, n:11, pp:1357-1362 [Journal]
  4. Zemin Jin, Mikio Kano, Xueliang Li, Bing Wei
    Partitioning 2-edge-colored complete multipartite graphs into monochromatic cycles, paths and trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2006, v:11, n:4, pp:445-454 [Journal]
  5. Zemin Jin, Xueliang Li
    On the k-path cover problem for cacti. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:355, n:3, pp:354-363 [Journal]

  6. Heterochromatic tree partition numbers for complete bipartite graphs. [Citation Graph (, )][DBLP]

  7. Graphs with the second largest number of maximal independent sets. [Citation Graph (, )][DBLP]

  8. Bipartite rainbow numbers of matchings. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002