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

On prime labellings. - Hung-Lin Fu; Kuo-Ching Huang (Discret. Math., 1994)

Connectivity of cages. - Hung-Lin Fu; Kuo-Ching Huang; Christopher A. Rodger (J. Graph Theory, 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)

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

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

The linear 3-arboricity of Kn, n and Kn. - Hung-Lin Fu; Kuo-Ching Huang; Chih-Hung Yen (Discret. Math., 2008)

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)

A note on optimal pebbling of hypercubes. - Hung-Lin Fu; Kuo-Ching Huang; Chin-Lin Shiue (J. Comb. Optim., 2013)

Nordhaus-Gaddum-type relations of three graph coloring parameters. - Kuo-Ching Huang; Ko-Wei Lih (Discret. Appl. Math., 2014)

Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths. - Chin-Mei Fu; Kuo-Ching Huang; Miwako Mishima (Graphs Comb., 2016)

A note on m-near-factor-critical graphs. - Kuo-Ching Huang; Ko-Wei Lih (Eur. J. Comb., 2019)