Kuo-Ching Huang

14 papers Journal 14
YearRankTypeTitle / Venue / Authors
2019 J jnl
A note on m-near-factor-critical graphs.
Eur. J. Comb.
Kuo-Ching Huang, Ko-Wei Lih
2016 J jnl
Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths.
Graphs Comb.
Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima
2014 J jnl
Nordhaus-Gaddum-type relations of three graph coloring parameters.
Discret. Appl. Math.
Kuo-Ching Huang, Ko-Wei Lih
2013 J jnl
A note on optimal pebbling of hypercubes.
J. Comb. Optim.
Hung-Lin Fu, Kuo-Ching Huang, Chin-Lin Shiue
2013 J jnl
Intersecting k-Uniform Families Containing all the k-Subsets of a Given Set.
Electron. J. Comb.
Wei-Tian Li, Bor-Liang Chen, Kuo-Ching Huang, Ko-Wei Lih
2008 J jnl
Chromatic coloring with a maximum color class.
Discret. Math.
Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen
2008 J jnl
The linear 3-arboricity of K
Discret. Math.
Hung-Lin Fu, Kuo-Ching Huang, Chih-Hung Yen
2002 J jnl
On the linear
Discret. Math.
Bor-Liang Chen, Kuo-Ching Huang
2000 J jnl
Linear k-arboricities on trees.
Discret. Appl. Math.
Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang
1999 J jnl
Total colorings of equibipartite graphs.
Discret. Math.
Bor-Liang Chen, Lei Dong, Qizhang Liu, Kuo-Ching Huang
1998 J jnl
A study of the total chromatic number of equibipartite graphs.
Discret. Math.
Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang
1997 J jnl
Connectivity of cages.
J. Graph Theory
Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger
1994 J jnl
On prime labellings.
Discret. Math.
Hung-Lin Fu, Kuo-Ching Huang
1991 J jnl
Decomposing graphs into forests of paths with size less than three.
Australas. J Comb.
Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang