Hamiltonian uniform subset graphs. - Bor-Liang Chen; Ko-Wei Lih (J. Comb. Theory B, 1987)

Diameters of iterated clique graphs of chordal graphs. - Bor-Liang Chen; Ko-Wei Lih (J. Graph Theory, 1990)

Decomposing graphs into forests of paths with size less than three. - Bor-Liang Chen; Hung-Lin Fu; Kuo-Ching Huang (Australas. J Comb., 1991)

Total colorings of graphs of order 2n having maximum degree 2n-2. - Bor-Liang Chen; Hung-Lin Fu (Graphs Comb., 1992)

A Note on the m-Bounded Chromatic Number of a Tree. - Bor-Liang Chen; Ko-Wei Lih (Eur. J. Comb., 1993)

Edge domination in complete partite graphs. - Bor-Liang Chen; Hung-Lin Fu (Discret. Math., 1994)

Equitable Coloring and the Maximum Degree. - Bor-Liang Chen; Ko-Wei Lih; Pou-Lin Wu (Eur. J. Comb., 1994)

Equitable Coloring of Trees. - Bor-Liang Chen; Ko-Wei Lih (J. Comb. Theory B, 1994)

Equitable and m-Bounded Coloring of Split Graphs. - Bor-Liang Chen; Ming-Tat Ko; Ko-Wei Lih (Combinatorics and Computer Science, 1995)

On the decomposition constructions for perfect secret sharing schemes. - Hung-Min Sun; Bor-Liang Chen (ICICS, 1997)

A study of the total chromatic number of equibipartite graphs. - Bor-Liang Chen; Chun-Kan Cheng; Hung-Lin Fu; Kuo-Ching Huang (Discret. Math., 1998)

Total colorings of equibipartite graphs. - Bor-Liang Chen; Lei Dong; Qi Zhang Liu; Kuo-Ching Huang (Discret. Math., 1999)

Linear k-arboricities on trees. - Gerard J. Chang; Bor-Liang Chen; Hung-Lin Fu; Kuo-Ching Huang (Discret. Appl. Math., 2000)

A rapid prototyping embedded system platform and its HW/SW communication interface generation and verification. - Yin-Tsung Hwang; Cheng-Ji Chang; Bor-Liang Chen (APCCAS (1), 2002)

On the linear k-arboricity of Kn and Kn, n. - Bor-Liang Chen; Kuo-Ching Huang (Discret. Math., 2002)

Near automorphisms of cycles. - Chia-Fen Chang; Bor-Liang Chen; Hung-Lin Fu (Discret. Math., 2008)

Chromatic coloring with a maximum color class. - Bor-Liang Chen; Kuo-Ching Huang; Chih-Hung Yen (Discret. Math., 2008)

Equitable Δ-coloring of graphs. - Bor-Liang Chen; Chih-Hung Yen (Discret. Math., 2012)

Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set. - Wei-Tian Li; Bor-Liang Chen; Kuo-Ching Huang; Ko-Wei Lih (Electron. J. Comb., 2013)

Equivalence of two conjectures on equitable coloring of graphs. - Bor-Liang Chen; Ko-Wei Lih; Chih-Hung Yen (J. Comb. Optim., 2013)