Qingde Kang

According to our database1, Qingde Kang authored at least 34 papers between 1991 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs.
Graphs Comb., 2015

Completing the spectrum for large sets of extended directed triple systems.
Discret. Math., 2015

2014
The Spectrum Meta(H > T, λ) for Some Subgraphs H and T of K 4.
Graphs Comb., 2014

2013
Large Sets of Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs.
Graphs Comb., 2013

Nonisomorphic Maximum Packing and Minimum Covering of K v with 8-Cycles.
Graphs Comb., 2013

Perfect T(G)-triple system for each graph G with five vertices and seven edges.
Ars Comb., 2013

2012
Existence for perfect T(K<sub>1</sub>, k)-triple systems.
Ars Comb., 2012

Packings and coverings for four particular graphs each with six vertices and nine edges (λ = 1).
Ars Comb., 2012

Large sets of λ-fold K<sub>1, 3</sub>-factors of complete bipartite graphs.
Ars Comb., 2012

2011
Restricted t-wise L-intersecting families on set systems.
Eur. J. Comb., 2011

2010
On overlarge sets of Kirkman triple systems.
Discret. Math., 2010

Large sets of extended directed triple systems with odd orders.
Discret. Math., 2010

G-decomposition of λK<sub>v</sub>, where G has six vertices and nine edges.
Ars Comb., 2010

Large sets of λ-fold P<sub>3</sub>-factors in K<sub>v, v</sub>.
Ars Comb., 2010

2009
A tripling construction for overlarge sets of KTS.
Discret. Math., 2009

Large sets of extended directed triple systems with even orders.
Discret. Math., 2009

2008
Large sets of Hamilton cycle decompositions of complete bipartite graphs.
Eur. J. Comb., 2008

Large sets of Hamilton cycle and path decompositions.
Discret. Math., 2008

More large sets of resolvable MTS and resolvable DTS with odd orders.
Discret. Math., 2008

Another construction for large sets of Kirkman triple systems.
Des. Codes Cryptogr., 2008

Graph designs for eight graphs with six vertices and eight edges (index >1).
Ars Comb., 2008

Graph designs for nine graphs with six vertices and nine edges.
Ars Comb., 2008

2006
Decomposing complete graphs into isomorphic subgraphs with six vertices and seven edges.
Ars Comb., 2006

2004
Packings and coverings of lambda<i>K<sub>v</sub></i> by <i>k</i>-circuits with one chord.
Discret. Math., 2004

Decompositions of λK<sub>v</sub> into k-circuits with one chord.
Australas. J Comb., 2004

2001
The spectrum for large set of disjoint incomplete Latin squares.
Discret. Math., 2001

The integral sum number of complete bipartite graphs <i>K</i><sub>r, s</sub>.
Discret. Math., 2001

Self-converse Mendelsohn designs with odd block size.
Australas. J Comb., 2001

Self-converse Mendelsohn designs with block size 6q.
Australas. J Comb., 2001

2000
Large sets of oriented triple systems with resolvability.
Discret. Math., 2000

1996
The spectrum of self-converse MTS.
Ars Comb., 1996

1993
Further results about large sets of disjoint Mendelsohn triple systems.
Discret. Math., 1993

1992
A Completion of the Spectrum for Large Sets of Disjoint Transitive Triple Systems.
J. Comb. Theory A, 1992

1991
The construction of large sets of disjoint Mendelsohn triple systems of order 2<sup>n</sup> + 2.
Discret. Math., 1991


  Loading...