
Search the dblp DataBase
ShengChyang Liaw:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Gerard J. Chang, ShengChyang Liaw
The L(2, 1)labeling problem on ditrees. [Citation Graph (0, 0)][DBLP] Ars Comb., 2003, v:66, n:, pp: [Journal]
 ShengChyang Liaw, David Kuo, Gerard J. Chang
Integral Sum Numbers of Graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:54, n:, pp: [Journal]
 Gerard J. Chang, ShengChyang Liaw, HongGwa Yeh
kSubdomination in graphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2002, v:120, n:13, pp:5560 [Journal]
 Gerard J. Chang, JerJeong Chen, David Kuo, ShengChyang Liaw
Distancetwo labelings of digraphs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:8, pp:10071013 [Journal]
 ShengChyang Liaw, Zhishi Pan, Xuding Zhu
Construction of K_{n}minor free graphs with given circular chromatic number. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:263, n:13, pp:191206 [Journal]
 ShengChyang Liaw, Gerard J. Chang
Generalized Diameters and Rabin Numbers of Networks. [Citation Graph (0, 0)][DBLP] J. Comb. Optim., 1998, v:2, n:4, pp:371384 [Journal]
 Frank K. Hwang, ShengChyang Liaw
On nonblocking multicast threestage Clos networks. [Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2000, v:8, n:4, pp:535539 [Journal]
 ShengChyang Liaw, Gerard J. Chang
Rabin numbers of Butterfly networks. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:13, pp:219227 [Journal]
Search in 0.002secs, Finished in 0.002secs
