Bor-Liang Chen

	2012
16		Bor-Liang Chen, Chih-Hung Yen: Equitable Δ-coloring of graphs. Discrete Mathematics 312(9): 1512-1517 (2012)
	2008
15		Bor-Liang Chen, Kuo-Ching Huang, Chih-Hung Yen: Chromatic coloring with a maximum color class. Discrete Mathematics 308(23): 5533-5537 (2008)
14		Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu: Near automorphisms of cycles. Discrete Mathematics 308(7): 1088-1092 (2008)
	2002
13		Yin-Tsung Hwang, Cheng-Ji Chang, Bor-Liang Chen: A rapid prototyping embedded system platform and its HW/SW communication interface generation and verification. APCCAS (1) 2002: 481-484
12		Bor-Liang Chen, Kuo-Ching Huang: On the linear k-arboricity of Kn and Kn, n. Discrete Mathematics 254(1-3): 51-61 (2002)
	2000
11		Gerard J. Chang, Bor-Liang Chen, Hung-Lin Fu, Kuo-Ching Huang: Linear k-arboricities on trees. Discrete Applied Mathematics 103(1-3): 281-287 (2000)
	1999
10		Bor-Liang Chen, Lei Dong, Qi Zhang Liu, Kuo-Ching Huang: Total colorings of equibipartite graphs. Discrete Mathematics 194(1-3): 59-65 (1999)
	1998
9		Bor-Liang Chen, Chun-Kan Cheng, Hung-Lin Fu, Kuo-Ching Huang: A study of the total chromatic number of equibipartite graphs. Discrete Mathematics 184(1-3): 49-60 (1998)
	1997
8		Hung-Min Sun, Bor-Liang Chen: On the decomposition constructions for perfect secret sharing schemes. ICICS 1997: 50-60
	1995
7		Bor-Liang Chen, Ming-Tat Ko, Ko-Wei Lih: Equitable and m-Bounded Coloring of Split Graphs. Combinatorics and Computer Science 1995: 1-5
	1994
6		Bor-Liang Chen, Hung-Lin Fu: Edge domination in complete partite graphs. Discrete Mathematics 132(1-3): 29-35 (1994)
5		Bor-Liang Chen, Ko-Wei Lih, Pou-Lin Wu: Equitable Coloring and the Maximum Degree. Eur. J. Comb. 15(5): 443-447 (1994)
4		Bor-Liang Chen, Ko-Wei Lih: Equitable Coloring of Trees. J. Comb. Theory, Ser. B 61(1): 83-87 (1994)
	1993
3		Bor-Liang Chen, Ko-Wei Lih: A Note on the m-Bounded Chromatic Number of a Tree. Eur. J. Comb. 14(4): 311-312 (1993)
	1992
2		Bor-Liang Chen, Hung-Lin Fu: Total colorings of graphs of order 2n having maximum degree 2n-2. Graphs and Combinatorics 8(2): 119-123 (1992)
	1987
1		Bor-Liang Chen, Ko-Wei Lih: Hamiltonian uniform subset graphs. J. Comb. Theory, Ser. B 42(3): 257-263 (1987)

Coauthor Index

1	Cheng-Ji Chang	[13]
2	Chia-Fen Chang	[14]
3	Gerard J. Chang (Gerard Jennhwa Chang)	[11]
4	Chun-Kan Cheng	[9]
5	Lei Dong	[10]
6	Hung-Lin Fu (H. L. Fu)	[2] [6] [9] [11] [14]
7	Kuo-Ching Huang	[9] [10] [11] [12] [15]
8	Yin-Tsung Hwang	[13]
9	Ming-Tat Ko	[7]
10	Ko-Wei Lih	[1] [3] [4] [5] [7]
11	Qi Zhang Liu	[10]
12	Hung-Min Sun	[8]
13	Pou-Lin Wu	[5]
14	Chih-Hung Yen	[15] [16]

Colors in the list of coauthors

Last update Tue May 29 01:28:40 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page