default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDQingde Kang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j34]Yuanyuan Liu, Qingde Kang:
Completing the spectrum for large sets of extended directed triple systems. Discret. Math. 338(9): 1573-1576 (2015)- [j33]Hongtao Zhao, Qingde Kang:
Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs. Graphs Comb. 31(6): 2481-2491 (2015) - 2014
- [j32]Landang Yuan, Yanli Zhang, Yingtao Hou, Qingde Kang:
The Spectrum Meta(H > T, λ) for Some Subgraphs H and T of K 4. Graphs Comb. 30(5): 1301-1318 (2014) - 2013
- [j31]Yanli Zhang, Qingde Kang, Yingtao Hou:
Perfect T(G)-triple system for each graph G with five vertices and seven edges. Ars Comb. 109: 31-44 (2013) - [j30]Hongtao Zhao, Qingde Kang:
Large Sets of Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs. Graphs Comb. 29(1): 145-155 (2013) - [j29]Qingde Kang, Mingchao Li, Jingjing Huo:
Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles. Graphs Comb. 29(4): 1007-1040 (2013) - 2012
- [j28]Yuanyuan Liu, Qingde Kang, Mingchao Li:
Existence for perfect T(K1, k)-triple systems. Ars Comb. 103: 359-376 (2012) - [j27]Qingde Kang, Xiaoshan Liu, Huixian Jia:
Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1). Ars Comb. 106: 11-32 (2012) - [j26]Guohui Hao, Qingde Kang:
Large sets of λ-fold K1, 3-factors of complete bipartite graphs. Ars Comb. 107: 465-472 (2012) - 2011
- [j25]Qingde Kang, Jiuqiang Liu, Larry X. W. Wang:
Restricted t-wise L-intersecting families on set systems. Eur. J. Comb. 32(3): 464-471 (2011) - 2010
- [j24]Qingde Kang, Chunping Ma, Hongtao Zhao:
G-decomposition of λKv, where G has six vertices and nine edges. Ars Comb. 94 (2010) - [j23]Guohui Hao, Qingde Kang:
Large sets of λ-fold P3-factors in Kv, v. Ars Comb. 96 (2010) - [j22]Landang Yuan, Qingde Kang:
On overlarge sets of Kirkman triple systems. Discret. Math. 310(15-16): 2119-2125 (2010) - [j21]Yuanyuan Liu, Qingde Kang:
Large sets of extended directed triple systems with odd orders. Discret. Math. 310(24): 3619-3632 (2010)
2000 – 2009
- 2009
- [j20]Landang Yuan, Qingde Kang:
A tripling construction for overlarge sets of KTS. Discret. Math. 309(4): 975-981 (2009) - [j19]Yuanyuan Liu, Qingde Kang:
Large sets of extended directed triple systems with even orders. Discret. Math. 309(23-24): 6515-6529 (2009) - 2008
- [j18]Landang Yuan, Qingde Kang:
Graph designs for eight graphs with six vertices and eight edges (index >1). Ars Comb. 87 (2008) - [j17]Qingde Kang, Hongtao Zhao, Chunping Ma:
Graph designs for nine graphs with six vertices and nine edges. Ars Comb. 88 (2008) - [j16]Landang Yuan, Qingde Kang:
Another construction for large sets of Kirkman triple systems. Des. Codes Cryptogr. 48(1): 35-42 (2008) - [j15]Qingde Kang, Hongtao Zhao:
More large sets of resolvable MTS and resolvable DTS with odd orders. Discret. Math. 308(5-6): 886-895 (2008) - [j14]Hongtao Zhao, Qingde Kang:
Large sets of Hamilton cycle and path decompositions. Discret. Math. 308(21): 4931-4940 (2008) - [j13]Qingde Kang, Hongtao Zhao:
Large sets of Hamilton cycle decompositions of complete bipartite graphs. Eur. J. Comb. 29(6): 1492-1501 (2008) - 2006
- [j12]Zihong Tian, Yanke Du, Qingde Kang:
Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges. Ars Comb. 81 (2006) - 2004
- [j11]Qingde Kang, Huijuan Zuo, Yanfang Zhang:
Decompositions of λKv into k-circuits with one chord. Australas. J Comb. 30: 229-246 (2004) - [j10]Qingde Kang, Yanfang Zhang, Huijuan Zuo:
Packings and coverings of lambdaKv by k-circuits with one chord. Discret. Math. 279(1-3): 287-315 (2004) - 2001
- [j9]Xiuling Shan, Qingde Kang, Qiujie Sun:
Self-converse Mendelsohn designs with odd block size. Australas. J Comb. 24: 13-34 (2001) - [j8]Caikun Liu, Qingde Kang, Zhifen Guo:
Self-converse Mendelsohn designs with block size 6q. Australas. J Comb. 24: 169-192 (2001) - [j7]Jianguo Lei, Qingde Kang, Yanxun Chang:
The spectrum for large set of disjoint incomplete Latin squares. Discret. Math. 238(1-3): 89-98 (2001) - [j6]Wenjie He, Yufa Shen, Lixin Wang, Yanxun Chang, Qingde Kang, Xinkai Yu:
The integral sum number of complete bipartite graphs Kr, s. Discret. Math. 239(1-3): 137-146 (2001) - 2000
- [j5]Qingde Kang, Zihong Tian:
Large sets of oriented triple systems with resolvability. Discret. Math. 212(3): 199-221 (2000)
1990 – 1999
- 1996
- [j4]Yanxun Chang, Guihua Yang, Qingde Kang:
The spectrum of self-converse MTS. Ars Comb. 44 (1996) - 1993
- [j3]Qingde Kang, Yanxun Chang:
Further results about large sets of disjoint Mendelsohn triple systems. Discret. Math. 118(1-3): 263-268 (1993) - 1992
- [j2]Qingde Kang, Yanxun Chang:
A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems. J. Comb. Theory A 60(2): 287-294 (1992) - 1991
- [j1]Qingde Kang:
The construction of large sets of disjoint Mendelsohn triple systems of order 2n + 2. Discret. Math. 90(2): 199-205 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
