dblp.uni-trier.dewww.uni-trier.de

Cheng-Kuan Lin

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2009
19EECheng-Kuan Lin, Tung-Yang Ho, Jimmy J. M. Tan, Lih-Hsing Hsu: Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. Int. J. Comput. Math. 86(1): 57-66 (2009)
18EETz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu: A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. J. Comb. Optim. 17(3): 312-322 (2009)
17EEChung-Hao Chang, Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, Lih-Hsing Hsu: The super spanning connectivity and super spanning laceability of the enhanced hypercubes. The Journal of Supercomputing 48(1): 66-87 (2009)
16EETzu-Liang Kung, Cheng-Kuan Lin, Tyne Liang, Lih-Hsing Hsu, Jimmy J. M. Tan: On the bipanpositionable bipanconnectedness of hypercubes. Theor. Comput. Sci. 410(8-10): 801-811 (2009)
2008
15EECheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu: Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. ISPAN 2008: 151-158
14EETz-Liang Kueng, Cheng-Kuan Lin, Tyne Liang, Jimmy J. M. Tan, Lih-Hsing Hsu: Fault-tolerant hamiltonian connectedness of cycle composition networks. Applied Mathematics and Computation 196(1): 245-256 (2008)
13EECheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu: On spanning connected graphs. Discrete Mathematics 308(7): 1330-1333 (2008)
12EECheng-Kuan Lin, Jimmy J. M. Tan, Lih-Hsing Hsu, Eddie Cheng, László Lipták: Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. Journal of Interconnection Networks 9(1/2): 83-97 (2008)
2007
11EECheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: On the spanning connectivity of graphs. Discrete Mathematics 307(2): 285-289 (2007)
10EECheng-Kuan Lin, Jimmy J. M. Tan, D. Frank Hsu, Lih-Hsing Hsu: On the spanning connectivity and spanning laceability of hypercube-like networks. Theor. Comput. Sci. 381(1-3): 218-229 (2007)
2006
9 Shin-Shin Kao, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: Panpositionable Hamiltonian Graphs. Ars Comb. 81: (2006)
8EEHong-Chun Hsu, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: The Spanning Connectivity of the (n, k)-star Graphs. Int. J. Found. Comput. Sci. 17(2): 415-434 (2006)
7EEChao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. Journal of Interconnection Networks 7(2): 235-256 (2006)
6EECheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu: On the spanning w-wide diameter of the star graph. Networks 48(4): 235-249 (2006)
2005
5EEChao-Ming Sun, Cheng-Kuan Lin, Hua-Min Huang: Mutually Independent Hamiltonian Cycles in Hypercubes. ISPAN 2005: 504-509
4EECheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu, Sheng Bau: Mutually independent hamiltonian paths in star networks. Networks 46(2): 110-117 (2005)
3EECheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: The super connectivity of the pancake graphs and the super laceability of the star graphs. Theor. Comput. Sci. 339(2-3): 257-271 (2005)
2004
2EECheng-Kuan Lin, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu: The Spanning Diameter of the Star Graphs. ISPAN 2004: 551-556
1EEChung-Haw Chang, Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu: The super laceability of the hypercubes. Inf. Process. Lett. 92(1): 15-21 (2004)

Coauthor Index

1Sheng Bau [4]
2Chung-Hao Chang [17]
3Chung-Haw Chang [1]
4Eddie Cheng [12]
5Tung-Yang Ho [19]
6D. Frank Hsu [2] [6] [10] [15]
7Hong-Chun Hsu [8]
8Lih-Hsing Hsu [1] [2] [3] [4] [6] [7] [8] [9] [10] [11] [12] [13] [14] [15] [16] [17] [18] [19]
9Hua-Min Huang [1] [2] [3] [4] [5] [6] [7] [8] [9] [11] [13] [15] [17]
10Shin-Shin Kao [9]
11Tz-Liang Kueng [14] [18]
12Tzu-Liang Kung [16]
13Tyne Liang [14] [16] [18]
14László Lipták [12]
15Chao-Ming Sun [5] [7]
16Jimmy J. M. Tan [10] [12] [13] [14] [15] [16] [17] [18] [19]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)