Kuo-Ching Huang

According to our database, Kuo-Ching Huang authored at least 14 papers between 1991 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

A note on m-near-factor-critical graphs.

Kuo-Ching Huang, Ko-Wei Lih

Eur. J. Comb., 2019

2016

Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths.

Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima

Graphs Comb., 2016

2014

Nordhaus-Gaddum-type relations of three graph coloring parameters.

Kuo-Ching Huang, Ko-Wei Lih

Discret. Appl. Math., 2014

2013

A note on optimal pebbling of hypercubes.

Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue

J. Comb. Optim., 2013

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

2008

The linear 3-arboricity of K_{n, n} and K_n.

Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen

Discret. Math., 2008

Chromatic coloring with a maximum color class.

Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen

Discret. Math., 2008

2002

On the linear <i>k</i>-arboricity of <i>K_n</i> and <i>K_{n, n}</i>.

Bor-Liang Chen, Kuo-Ching Huang

Discret. Math., 2002

2000

Linear k-arboricities on trees.

Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang

Discret. Appl. Math., 2000

1999

Total colorings of equibipartite graphs.

Bor-Liang Chen, Lei Dong, Qi Zhang Liu, Kuo-Ching Huang

Discret. Math., 1999

1998

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

1997

Connectivity of cages.

Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger

J. Graph Theory, 1997

1994

On prime labellings.

Hung-Lin Fu, Kuo-Ching Huang

Discret. Math., 1994

1991

Decomposing graphs into forests of paths with size less than three.

Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang

Australas. J Comb., 1991