The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Qingde Kang: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Yanxun Chang, Guihua Yang, Qingde Kang
    The spectrum of self-converse MTS. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:44, n:, pp:- [Journal]
  2. Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu
    The integral sum number of complete bipartite graphs Kr, s. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:239, n:1-3, pp:137-146 [Journal]
  3. Qingde Kang, Zihong Tian
    Large sets of oriented triple systems with resolvability. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:3, pp:199-221 [Journal]
  4. Qingde Kang, Yanfang Zhang, Huijuan Zuo
    Packings and coverings of lambdaKv by k-circuits with one chord. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:279, n:1-3, pp:287-315 [Journal]
  5. Jianguo Lei, Qingde Kang, Yanxun Chang
    The spectrum for large set of disjoint incomplete Latin squares. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:238, n:1-3, pp:89-98 [Journal]
  6. Qingde Kang, Yanxun Chang
    A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1992, v:60, n:2, pp:287-294 [Journal]
  7. Qingde Kang
    The construction of large sets of disjoint Mendelsohn triple systems of order 2n + 2. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:90, n:2, pp:199-205 [Journal]
  8. Qingde Kang, Yanxun Chang
    Further results about large sets of disjoint Mendelsohn triple systems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:118, n:1-3, pp:263-268 [Journal]

  9. Graph designs for nine graphs with six vertices and nine edges. [Citation Graph (, )][DBLP]


  10. Graph designs for eight graphs with six vertices and eight edges (index >1). [Citation Graph (, )][DBLP]


  11. Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges. [Citation Graph (, )][DBLP]


  12. Another construction for large sets of Kirkman triple systems. [Citation Graph (, )][DBLP]


  13. More large sets of resolvable MTS and resolvable DTS with odd orders. [Citation Graph (, )][DBLP]


  14. Large sets of Hamilton cycle and path decompositions. [Citation Graph (, )][DBLP]


  15. A tripling construction for overlarge sets of KTS. [Citation Graph (, )][DBLP]


  16. Large sets of extended directed triple systems with even orders. [Citation Graph (, )][DBLP]


  17. On overlarge sets of Kirkman triple systems. [Citation Graph (, )][DBLP]


  18. Large sets of Hamilton cycle decompositions of complete bipartite graphs. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002