Beiliang Du

发表

P3-factorization of complete bipartite symmetric digraphs

Beiliang Du, 1999, Australas. J Comb..

The Existence of Self-Conjugate Self-Orthogonal Idempotent Diagonal Latin Squares

Walter D. Wallis, Beiliang Du, 1999, Ars Comb..

On the existence of three incomplete idempotent MOLS

Beiliang Du, 1995, Australas. J Comb..

K1, p2-factorization of complete bipartite graphs

Beiliang Du, 1998, Discret. Math..

The existence of augmented resolvable Steiner quadruple systems

Lijun Ji, Beiliang Du, Zhaoping Meng, 2010, Discret. Math..

Kirkman packing designs KPD ({w, sast}, v) and related threshold schemes

Haitao Cao, Beiliang Du, 2004, Discret. Math..

Existence of optimal strong partially balanced designs with block size five

Beiliang Du, B. Du, 2004, Discret. Math..

The existence of bimatching designs

Beiliang Du, 2001, Australas. J Comb..

Kp, q-factorization of the complete bipartite graph Km, n

Jian Wang, Beiliang Du, 2004, Discret. Math..

Existence of self-orthogonal diagonal Latin squares with a missing subsquare

Hantao Zhang, Frank E. Bennett, Beiliang Du, 2003, Discret. Math..

A new class of splitting 3-designs

Beiliang Du, Miao Liang, 2011, Des. Codes Cryptogr..

The last twenty orders of (1, 2)-resolvable Steiner quadruple systems

Beiliang Du, Zhaoping Meng, 2012, Discret. Math..

The Existence of Augmented Resolvable Candelabra Quadruple Systems with Three Even Groups

Beiliang Du, Zhaoping Meng, 2013, Graphs Comb..

New bounds for pairwise orthogonal diagonal Latin squares

Beiliang Du, 1993, Australas. J Comb..

A construction for t-fold perfect authentication codes with arbitration

Mingchao Li, Beiliang Du, Miao Liang, 2014, Des. Codes Cryptogr..

A few more RBIBDs with k = 5 and lambda = 1

Lie Zhu, Beiliang Du, Xuebin Zhang, 1991, Discret. Math..

On the existence of incomplete transversal designs with block size five

Beiliang Du, B. Du, 1994, Discret. Math..

P2k-factorization of complete bipartite multigraphs

Beiliang Du, 2000, Australas. J Comb..

The existence of resolvable Mendelsohn designs RMD({3, s*}, v)

Yan Zhang, Beiliang Du, Yan Zhang, 2005, The Australasian Journal of Combinatorics.

P2k+1-factorization of symmetric complete bipartite multi-digraphs

Jian Wang, Beiliang Du, 2014, Ars Comb..

Kl, k-factorization of complete bipartite graphs

Jian Wang, Beiliang Du, 2002, Discret. Math..

On the existence of (v, 7, 1)-perfect Mendelsohn designs

Lie Zhu, Frank E. Bennett, Beiliang Du, 1990, Discret. Math..

The existence of orthogonal diagonal Latin squares with subsquares

Beiliang Du, B. Du, 1996, Discret. Math..

A new class of 3-fold perfect splitting authentication codes

Beiliang Du, Miao Liang, Sufang Jiang, 2016, Ars Comb..

The spectrum of optimal strong partially balanced designs with block size five

Beiliang Du, B. Du, 2004, Discret. Math..

K1, pq-factorization of complete bipartite graphs

Beiliang Du, 2002, Australas. J Comb..

The Spectrum of Tetrahedral Quadruple Systems

Jian Wang, Beiliang Du, Miao Liang, 2011, Graphs Comb..

A construction for optimal c-splitting authentication and secrecy codes

Jingyuan Chen, Mingchao Li, Beiliang Du, 2018, Des. Codes Cryptogr..

The existence of three idempotent IMOLS

R. Julian R. Abel, Beiliang Du, 2003, Discret. Math..

Support sizes of threefold quadruple systems

Jian Wang, Beiliang Du, Miao Liang, 2011, Discret. Math..

Some new results on mutually orthogonal frequency squares

Yan Zhang, Mingchao Li, Beiliang Du, 2014, Discret. Math..

Uniformly resolvable three-wise balanced designs with block sizes four and six

Lijun Ji, Beiliang Du, Zhaoping Meng, 2009, Discret. Math..

On bipartite factorization of complete bipartite multigraphs

Jian Wang, Jing Shi, Beiliang Du, 2013, Ars Comb..

Splitting balanced incomplete block designs

Beiliang Du, 2005, Australas. J Comb..

More mutually orthogonal Latin squares

Beiliang Du, 1992, Australas. J Comb..

A construction of t-fold perfect splitting authentication codes with equal deception probabilities

Mingchao Li, Beiliang Du, Miao Liang, 2014, Cryptography and Communications.

A few more BIBDs with k=8 or 9

Beiliang Du, 1994, Australas. J Comb..

(1, 2)-resolvable candelabra quadruple systems and Steiner quadruple systems

Jian Wang, Beiliang Du, Zhaoping Meng, 2012, Discret. Math..

P5-factorization of complete bipartite graphs

Jian Wang, Beiliang Du, 2008, Discret. Math..

Resolvable optimal strong partially balanced designs with block size four

Beiliang Du, B. Du, 2005, Discret. Math..

On the existence of self-orthogonal diagonal Latin squares

Beiliang Du, 1994, Australas. J Comb..

Existence of resolvable optimal strong partially balanced designs

Beiliang Du, B. Du, 2006, Discret. Appl. Math..

α‐Resolvable group divisible designs with block size three

Yan Zhang, Beiliang Du, B. Du, 2005 .

Splitting balanced incomplete block designs with block size 3 × 2

Beiliang Du, 2004 .

Resolvable candelabra quadruple systems with three groups

Beiliang Du, Zhaoping Meng, 2011 .