Bor-Liang Chen

20 papers C 1Journal 17Unranked 2
YearRankTypeTitle / Venue / Authors
2013 J jnl
Equivalence of two conjectures on equitable coloring of graphs.
J. Comb. Optim.
Bor-Liang Chen, Ko-Wei Lih, Chih-Hung Yen
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
2012 J jnl
Equitable Δ-coloring of graphs.
Discret. Math.
Bor-Liang Chen, Chih-Hung Yen
2008 J jnl
Chromatic coloring with a maximum color class.
Discret. Math.
Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen
2008 J jnl
Near automorphisms of cycles.
Discret. Math.
Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu
2002 — conf
A rapid prototyping embedded system platform and its HW/SW communication interface generation and verification.
APCCAS (1)
Yin-Tsung Hwang, Cheng-Ji Chang, Bor-Liang Chen
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 C conf
On the decomposition constructions for perfect secret sharing schemes.
ICICS
Hung-Min Sun, Bor-Liang Chen
1995 — conf
Equitable and
Combinatorics and Computer Science
Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih
1994 J jnl
Edge domination in complete partite graphs.
Discret. Math.
Bor-Liang Chen, Hung-Lin Fu
1994 J jnl
Equitable Coloring and the Maximum Degree.
Eur. J. Comb.
Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu
1994 J jnl
Equitable Coloring of Trees.
J. Comb. Theory B
Bor-Liang Chen, Ko-Wei Lih
1993 J jnl
A Note on the m-Bounded Chromatic Number of a Tree.
Eur. J. Comb.
Bor-Liang Chen, Ko-Wei Lih
1992 J jnl
Total colorings of graphs of order 2
Graphs Comb.
Bor-Liang Chen, Hung-Lin Fu
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
1990 J jnl
Diameters of iterated clique graphs of chordal graphs.
J. Graph Theory
Bor-Liang Chen, Ko-Wei Lih
1987 J jnl
Hamiltonian uniform subset graphs.
J. Comb. Theory B
Bor-Liang Chen, Ko-Wei Lih