On a multiplicative graph function conjecture. - Lih-Hsing Hsu (Discret. Math., 1983)

Dependence of tree copy functions. - Lih-Hsing Hsu (Discret. Math., 1985)

A class of additive multiplicative graph functions. - Lih-Hsing Hsu; Chiuyuan Chen; En-Yih Jean (Discret. Math., 1987)

Generalized homomorphism graph functions. - Lih-Hsing Hsu (Discret. Math., 1990)

Undordered Tree Contraction. - Lih-Hsing Hsu; Jones J. J. Wang (ICCI, 1991)

A Linear Time Algorithm to Recognize the Double Euler Trail for Series-Parallel Networks. - Lih-Hsing Hsu; Jeng-Yan Hwang; Tung-Yang Ho; Chang-Hsiung Tsai (ISA, 1991)

Finding the Most Vital Edge with Respect to Minimum Spanning Tree in Weighted Graphs. - Lih-Hsing Hsu; Rong-Hong Jan; Yu-Che Lee; Chun-Nan Hung; Maw-Sheng Chern (Inf. Process. Lett., 1991)

Maximum independent number for series-parallel networks. - Lih-Hsing Hsu; Shih-Yih Wang (Networks, 1991)

Maximum and Minimum Matchings for Series-Parallel Networks. - Shih-Yih Wang; Lih-Hsing Hsu (ICCI, 1992)

Data Structure for Graph Representations of a Network Having Double Euler Trails. - Ting-Yi Sung; Lih-Hsing Hsu; Jeng-Yan Hwang (IFIP Congress (1), 1992)

The Most Vital Edges with Respect to the Number of Spanning Trees in Two-Terminal Series-Parallel Graphs. - Rong-Hong Jan; Lih-Hsing Hsu; Yueh-Ying Lee (BIT, 1992)

Parallel algorithms for finding the most vital edge with respect to minimum spanning tree. - Lih-Hsing Hsu; Peng-Fei Wang; Chu-Tao Wu (Parallel Comput., 1992)

The most vital edges of matching in a bipartite graph. - Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung (Networks, 1993)

Matching Polynomials of Series-Parallel Graphs. - Lih-Hsing Hsu (Parallel Process. Lett., 1993)

A note on the minimum cut cover of graphs. - Tung-Yang Ho; Lih-Hsing Hsu (Oper. Res. Lett., 1994)

1-Edge Fault-Tolerant designs for Meshes. - Ray-Shyng Chou; Lih-Hsing Hsu (Parallel Process. Lett., 1994)

Element Perturbation Problems of Optimum Spanning Trees with Two-Parameter Objectives. - Yung-Cheng Chang; Lih-Hsing Hsu (Inf. Process. Lett., 1995)

A classification of graph capacity functions. - Lih-Hsing Hsu (J. Graph Theory, 1996)

Maximum and Minimum Matchings for Seriew-Parallel Networks. - Shih-Yih Wang; Lih-Hsing Hsu (J. Inf. Sci. Eng., 1996)

Transmitting on various network topologies. - Tung-Yang Ho; Lih-Hsing Hsu; Ting-Yi Sung (Networks, 1996)

A response to Volgenant's Addendum on the most vital edges. - Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung (Networks, 1996)

On minimal cost-reliability ratio spanning trees and related problems. - Yung-Cheng Chang; Lih-Hsing Hsu (Oper. Res. Lett., 1996)

Projective Torus Networks. - Ting-Yi Sung; Tung-Yang Ho; Lih-Hsing Hsu (COCOON, 1997)

A new shortest path routing algorithm and embedding cycles of crossed cube. - Chien-Ping Chang; Ting-Yi Sung; Lih-Hsing Hsu (ISPAN, 1997)

Faithful 1-Edge Fault Tolerant Graphs. - Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung (Inf. Process. Lett., 1997)

Extended Tree Contraction for Some parallel Algorithms on Series-Parallel Networks. - Jeng-Jung Wang; Shih-Yih Wang; Lih-Hsing Hsu; Ting-Yi Sung (J. Inf. Sci. Eng., 1997)

A New Family of Optimal 1-Hamiltonian Graphs with Small Diameter. - Jeng-Jung Wang; Ting-Yi Sung; Lih-Hsing Hsu; Men-Yang Lin (COCOON, 1998)

Broadcasting on Wormhole-Routed 2D Tori with Arbitrary Size. - Yomin Hou; Chien-Min Wang; M.-J. Tsai; Lih-Hsing Hsu (ICPADS, 1998)

Christmas Tree: A 1-Fault-Tolerant Network for Token Rings. - Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung (ICPADS, 1998)

Depth Contention-free Broadcasting on Torus Networks. - Yomin Hou; Chien-Min Wang; Lih-Hsing Hsu (International Conference on Supercomputing, 1998)

Fault Tolerant Token Ring Embedding in Double Loop Networks. - Ting-Yi Sung; Chun-Yuan Lin; Yen-Chu Chuang; Lih-Hsing Hsu (Inf. Process. Lett., 1998)

Optimal 1-Hamiltonian Graphs. - Jeng-Jung Wang; Chun-Nan Hung; Lih-Hsing Hsu (Inf. Process. Lett., 1998)

The Recognition of Double Euler Trails in Series-Parallel Networks. - Tung-Yang Ho; Ting-Yi Sung; Lih-Hsing Hsu; Chang-Hsiung Tsai; Jeng-Yan Hwang (J. Algorithms, 1998)

Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings. - Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung (Inf. Process. Lett., 1999)

The correct diameter of trivalent Cayley graphs. - Chang-Hsiung Tsai; Chun-Nan Hung; Lih-Hsing Hsu; Chung-Haw Chang (Inf. Process. Lett., 1999)

Topological Properties of Twisted Cube. - Chien-Ping Chang; Jyh-Nan Wang; Lih-Hsing Hsu (Inf. Sci., 1999)

Fault Diameter for Subercubes. - Jyh-Jian Sheu; Lih-Hsing Hsu (Parallel Process. Lett., 1999)

Fault-Free Hamiltonian Cycle in Faulty Möbius Cubes. - Wen-Tzeng Huang; Yen-Chu Chuang; Jimmy J. M. Tan; Lih-Hsing Hsu (Computación y Sistemas, 2000)

Optimal k-Fault-Tolerant Networks for Token Rings. - Ting-Yi Sung; Tung-Yang Ho; Chien-Ping Chang; Lih-Hsing Hsu (J. Inf. Sci. Eng., 2000)

Optimum Congested Routing Strategy on Twisted Cubes. - Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu; Ting-Yi Sung (J. Interconnect. Networks, 2000)

Construction schemes for fault-tolerant Hamiltonian graphs. - Jeng-Jung Wang; Chun-Nan Hung; Jimmy J. M. Tan; Lih-Hsing Hsu; Ting-Yi Sung (Networks, 2000)

Edge Congestion and Topological Properties of Crossed Cubes. - Chien-Ping Chang; Ting-Yi Sung; Lih-Hsing Hsu (IEEE Trans. Parallel Distributed Syst., 2000)

On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks. - Chun-Nan Hung; Jeng-Jung Wang; Ting-Yi Sung; Lih-Hsing Hsu (IEEE Trans. Parallel Distributed Syst., 2000)

Additive multiplicative increasing functions on nonnegative square matrices and multidigraphs. - Chung-Haw Chang; Yen-Chu Chuang; Lih-Hsing Hsu (Discret. Math., 2001)

The shuffle-cubes and their generalization. - Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu; Ting-Yi Sung (Inf. Process. Lett., 2001)

Routing properties of supercubes. - Jyh-Jian Sheu; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Sci., 2001)

A Family of Trivalent 1-Hamiltonia Graphs With Diameter O(log n). - Jeng-Jung Wang; Ting-Yi Sung; Lih-Hsing Hsu (J. Inf. Sci. Eng., 2001)

On the construction of combined k-fault-tolerant Hamiltonian graphs. - Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung (Networks, 2001)

Optimal Processor Mapping for Linear-Complement Communication on Hypercubes. - Yomin Hou; Chien-Min Wang; Chiu-Yu Ku; Lih-Hsing Hsu (IEEE Trans. Parallel Distributed Syst., 2001)

Adaptive Path-Based Multicast on Wormhole-Routed Hypercubes. - Chien-Min Wang; Yomin Hou; Lih-Hsing Hsu (Euro-Par, 2002)

Hamiltonian laceability on edge fault star graph. - Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (ICPADS, 2002)

Embedding Hamiltonian Paths and Hamiltonian Cycles in Faulty Pancake Graphs. - Chun-Nan Hung; Kao-Yung Liang; Lih-Hsing Hsu (ISPAN, 2002)

A note on the ultimate categorical matching in a graph. - Lih-Hsing Hsu (Discret. Math., 2002)

On the Fault-Tolerant Hamiltonicity of Faulty Crossed Cubes. - Wen-Tzeng Huang; Yen-Chu Chuang; Jimmy Jiann-Mean Tan; Lih-Hsing Hsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2002)

Optimal 1-edge fault-tolerant designs for ladders. - Yen-Chu Chuang; Lih-Hsing Hsu; Chung-Haw Chang (Inf. Process. Lett., 2002)

Fault-tolerant hamiltonian laceability of hypercubes. - Chang-Hsiung Tsai; Jimmy J. M. Tan; Tyne Liang; Lih-Hsing Hsu (Inf. Process. Lett., 2002)

Hamiltonian Properties of Faulty Recursive Circulant Graphs. - Chang-Hsiung Tsai; Jimmy J. M. Tan; Yen-Chu Chuang; Lih-Hsing Hsu (J. Interconnect. Networks, 2002)

Fault-Tolerant Hamiltonicity of Twisted Cubes. - Wen-Tzeng Huang; Jimmy J. M. Tan; Chun-Nan Hung; Lih-Hsing Hsu (J. Parallel Distributed Comput., 2002)

Super-connectivity and super-edge-connectivity for some interconnection networks. - Y-Chuang Chen; Jimmy J. M. Tan; Lih-Hsing Hsu; Shin-Shin Kao (Appl. Math. Comput., 2003)

Ring embedding in faulty pancake graphs. - Chun-Nan Hung; Hong-Chun Hsu; Kao-Yung Liang; Lih-Hsing Hsu (Inf. Process. Lett., 2003)

Brother trees: A family of optimal 1p-hamiltonian and 1-edge hamiltonian graphs. - Shin-Shin Kao; Lih-Hsing Hsu (Inf. Process. Lett., 2003)

Bipanconnectivity and edge-fault-tolerant bipancyclicity of hypercubes. - Tseng-Kuei Li; Chang-Hsiung Tsai; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2003)

Fault-tolerant cycle-embedding of crossed cubes. - Ming-Chien Yang; Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2003)

Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)-star graphs. - Hong-Chun Hsu; Yi-Lin Hsieh; Jimmy J. M. Tan; Lih-Hsing Hsu (Networks, 2003)

Cycle embedding in faulty wrapped butterfly graphs. - Chang-Hsiung Tsai; Tyne Liang; Lih-Hsing Hsu; Men-Yang Lin (Networks, 2003)

Ring Embedding in Faulty Augmented Cubes. - Hong-Chun Hsu; Liang-Chih Chiang; Jimmy J. M. Tan; Lih-Hsing Hsu (ISPAN, 2004)

The Spanning Diameter of the Star Graphs. - Cheng-Kuan Lin; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu (ISPAN, 2004)

On some super fault-tolerant Hamiltonian graphs. - Y-Chuang Chen; Chang-Hsiung Tsai; Lih-Hsing Hsu; Jimmy J. M. Tan (Appl. Math. Comput., 2004)

The super laceability of the hypercubes. - Chung-Haw Chang; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Inf. Process. Lett., 2004)

The super-connected property of recursive circulant graphs. - Chang-Hsiung Tsai; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2004)

Hyper hamiltonian laceability on edge fault star graph. - Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Sci., 2004)

Diagnosability of t-Connected Networks and Product Networks under the Comparison Diagnosis Model. - Chien-Ping Chang; Pao-Lien Lai; Jimmy J. M. Tan; Lih-Hsing Hsu (IEEE Trans. Computers, 2004)

Fault Hamiltonicity and Fault Hamiltonian Connectivity of the Arrangement Graphs. - Hong-Chun Hsu; Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (IEEE Trans. Computers, 2004)

The Diagnosability of the Matching Composition Network under the Comparison Diagnosis Model. - Pao-Lien Lai; Jimmy J. M. Tan; Chang-Hsiung Tsai; Lih-Hsing Hsu (IEEE Trans. Computers, 2004)

Cycles in Highly Faulty Hypercubes. - Ming-Chien Yang; Jimmy J. M. Tan; Lih-Hsing Hsu (FCS, 2005)

Spider web networks: a family of optimal, fault tolerant, hamiltonian bipartite graphs. - Shin-Shin Kao; Lih-Hsing Hsu (Appl. Math. Comput., 2005)

The globally bi-3* and hyper bi-3* connectedness of the spider web networks. - Shin-Shin Kao; Lih-Hsing Hsu (Appl. Math. Comput., 2005)

A note on edge fault tolerance with respect to hypercubes. - Tung-Yang Ho; Ting-Yi Sung; Lih-Hsing Hsu (Appl. Math. Lett., 2005)

Fault-Tolerant Pancyclicity of the Möbius Cubes. - Ming-Chien Yang; Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2005)

Mutually independent hamiltonian paths in star networks. - Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu; Sheng Bau (Networks, 2005)

Fault hamiltonicity of augmented cubes. - Hong-Chun Hsu; Liang-Chih Chiang; Jimmy J. M. Tan; Lih-Hsing Hsu (Parallel Comput., 2005)

Honeycomb rectangular disks. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (Parallel Comput., 2005)

Conditional Diagnosability Measures for Large Multiprocessor Systems. - Pao-Lien Lai; Jimmy J. M. Tan; Chien-Ping Chang; Lih-Hsing Hsu (IEEE Trans. Computers, 2005)

The super connectivity of the pancake graphs and the super laceability of the star graphs. - Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Theor. Comput. Sci., 2005)

The Globally Bi-3*-Connected Property of the Brother Trees. - Tung-Yang Ho; Po-Chun Kuo; Lih-Hsing Hsu (JCIS, 2006)

A recursively construction scheme for super fault-tolerant hamiltonian graphs. - Y-Chuang Chen; Lih-Hsing Hsu; Jimmy J. M. Tan (Appl. Math. Comput., 2006)

On mutually independent hamiltonian paths. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Tung-Yang Ho; Lih-Hsing Hsu (Appl. Math. Lett., 2006)

Panpositionable Hamiltonian Graphs. - Shin-Shin Kao; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Ars Comb., 2006)

Cubic planar hamiltonian graphs of various types. - Shin-Shin Kao; Kung-Ming Hsu; Lih-Hsing Hsu (Discret. Math., 2006)

The Spanning Connectivity of the (n, k)-star Graphs. - Hong-Chun Hsu; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Int. J. Found. Comput. Sci., 2006)

On embedding cycles into faulty twisted cubes. - Ming-Chien Yang; Tseng-Kuei Li; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Sci., 2006)

Mutually Independent Hamiltonian Paths and Cycles in Hypercubes. - Chao-Ming Sun; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (J. Interconnect. Networks, 2006)

On the spanning w-wide diameter of the star graph. - Cheng-Kuan Lin; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu (Networks, 2006)

On the spanning connectivity of graphs. - Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Discret. Math., 2007)

Node-pancyclicity and edge-pancyclicity of hypercube variants. - Ken S. Hu; Shyun-Shyun Yeoh; Chiuyuan Chen; Lih-Hsing Hsu (Inf. Process. Lett., 2007)

Edge-bipancyclicity of conditional faulty hypercubes. - Lun-Min Shih; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2007)

The globally Bi-3*-connected property of the honeycomb rectangular torus. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Sci., 2007)

On the equitable k *-laceability of hypercubes. - Chung-Haw Chang; Chao-Ming Sun; Hua-Min Huang; Lih-Hsing Hsu (J. Comb. Optim., 2007)

On cubic 2-independent Hamiltonian connected graphs. - Tung-Yang Ho; Chun-Nan Hung; Lih-Hsing Hsu (J. Comb. Optim., 2007)

Hamiltonicity of hypercubes with a constraint of required and faulty edges. - Lih-Hsing Hsu; Shu-Chung Liu; Yeong-Nan Yeh (J. Comb. Optim., 2007)

Hamiltonian laceability of Faulty Hypercubes. - Chao-Ming Sun; Chun-Nan Hung; Hua-Min Huang; Lih-Hsing Hsu; Yue-Dar Jou (J. Interconnect. Networks, 2007)

Hamiltonian circuit and linear array embeddings in faulty k-ary n-cubes. - Ming-Chien Yang; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Parallel Distributed Comput., 2007)

Highly fault-tolerant cycle embeddings of hypercubes. - Ming-Chien Yang; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Syst. Archit., 2007)

Panpositionable hamiltonicity of the alternating group graphs. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (Networks, 2007)

On the spanning connectivity and spanning laceability of hypercube-like networks. - Cheng-Kuan Lin; Jimmy J. M. Tan; D. Frank Hsu; Lih-Hsing Hsu (Theor. Comput. Sci., 2007)

On the Longest Fault-Free Paths in Hypercubes with More Faulty Nodes. - Tz-Liang Kueng; Tyne Liang; Jimmy J. M. Tan; Lih-Hsing Hsu (ISPAN, 2008)

Mutually Independent Hamiltonianicity of Pancake Graphs and Star Graphs. - Cheng-Kuan Lin; Jimmy J. M. Tan; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu (ISPAN, 2008)

Fault-tolerant hamiltonian connectedness of cycle composition networks. - Tz-Liang Kueng; Cheng-Kuan Lin; Tyne Liang; Jimmy J. M. Tan; Lih-Hsing Hsu (Appl. Math. Comput., 2008)

Panpositionable hamiltonicity and panconnectivity of the arrangement graphs. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (Appl. Math. Comput., 2008)

Hyper-Hamiltonian generalized Petersen graphs. - Ta-Cheng Mai; Jeng-Jung Wang; Lih-Hsing Hsu (Comput. Math. Appl., 2008)

On spanning connected graphs. - Cheng-Kuan Lin; Hua-Min Huang; Jimmy J. M. Tan; Lih-Hsing Hsu (Discret. Math., 2008)

Embedding hamiltonian paths in hypercubes with a required vertex in a fixed position. - Chung-Meng Lee; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2008)

Strong Menger connectivity with conditional faults on the class of hypercube-like networks. - Lun-Min Shih; Chieh-Feng Chiang; Lih-Hsing Hsu; Jimmy J. M. Tan (Inf. Process. Lett., 2008)

Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the Comparison Diagnosis Model. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (J. Interconnect. Networks, 2008)

Mutually independent hamiltonian cycles of binary wrapped butterfly graphs. - Tz-Liang Kueng; Tyne Liang; Lih-Hsing Hsu (Math. Comput. Model., 2008)

Fault-Tolerant Hamiltonicity of the WK-Recursive Networks. - Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu (ISPAN, 2009)

Mutually orthogonal hamiltonian connected graphs. - Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu (Appl. Math. Lett., 2009)

Embedding Hamiltonian paths in augmented cubes with a required vertex in a fixed position. - Chung-Meng Lee; Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (Comput. Math. Appl., 2009)

The bipanpositionable bipancyclic property of the hypercube. - Yuan-Kang Shih; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu (Comput. Math. Appl., 2009)

On the spanning fan-connectivity of graphs. - Cheng-Kuan Lin; Jimmy J. M. Tan; D. Frank Hsu; Lih-Hsing Hsu (Discret. Appl. Math., 2009)

Globally bi-3*-connected graphs. - Shin-Shin Kao; Hong-Chun Hsu; Lih-Hsing Hsu (Discret. Math., 2009)

Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. - Cheng-Kuan Lin; Jimmy J. M. Tan; Hua-Min Huang; D. Frank Hsu; Lih-Hsing Hsu (Discret. Math., 2009)

The Spanning Connectivity of the Burnt Pancake Graphs. - Cherng Chin; Tien-Hsiung Weng; Lih-Hsing Hsu; Shang-Chia Chiou (IEICE Trans. Inf. Syst., 2009)

Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks. - Cheng-Kuan Lin; Tung-Yang Ho; Jimmy J. M. Tan; Lih-Hsing Hsu (Int. J. Comput. Math., 2009)

Conditional fault hamiltonian connectivity of the complete graph. - Tung-Yang Ho; Yuan-Kang Shih; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Process. Lett., 2009)

Long paths in hypercubes with conditional node-faults. - Tz-Liang Kueng; Tyne Liang; Lih-Hsing Hsu; Jimmy J. M. Tan (Inf. Sci., 2009)

A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges. - Tz-Liang Kueng; Cheng-Kuan Lin; Tyne Liang; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Comb. Optim., 2009)

A New Isomorphic Definition of the Crossed Cube and its Spanning Connectivity. - Cheng-Kuan Lin; Chien-Ping Chang; Tung-Yang Ho; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Interconnect. Networks, 2009)

Fault-Tolerant Hamiltonian laceability and Fault-Tolerant Conditional Hamiltonian for Bipartite Hypercube-like Networks. - Cheng-Kuan Lin; Tung-Yang Ho; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Interconnect. Networks, 2009)

Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transposition Trees. - Lun-Min Shih; Chieh-Feng Chiang; Lih-Hsing Hsu; Jimmy J. M. Tan (J. Interconnect. Networks, 2009)

Conditional diagnosability of hypercubes under the comparison diagnosis model. - Guo-Huang Hsu; Chieh-Feng Chiang; Lun-Min Shih; Lih-Hsing Hsu; Jimmy J. M. Tan (J. Syst. Archit., 2009)

Embedding paths of variable lengths into hypercubes with conditional link-faults. - Tz-Liang Kueng; Cheng-Kuan Lin; Tyne Liang; Jimmy J. M. Tan; Lih-Hsing Hsu (Parallel Comput., 2009)

On the bipanpositionable bipanconnectedness of hypercubes. - Tzu-Liang Kung; Cheng-Kuan Lin; Tyne Liang; Lih-Hsing Hsu; Jimmy J. M. Tan (Theor. Comput. Sci., 2009)

The super spanning connectivity and super spanning laceability of the enhanced hypercubes. - Chung-Hao Chang; Cheng-Kuan Lin; Jimmy J. M. Tan; Hua-Min Huang; Lih-Hsing Hsu (J. Supercomput., 2009)

The Diagnosability of g-good-neighbor Conditional-Faulty Hypercube under PMC Model. - Cheng-Kuan Lin; Tzu-Liang Kung; Shao-Lun Peng; Jimmy J. M. Tan; Lih-Hsing Hsu (PDPTA, 2010)

Two Spanning Disjoint Paths with Required Length in Arrangement Graphs. - Yuan-Hsiang Teng; Yuan-Kang Shih; Jimmy J. M. Tan; Lih-Hsing Hsu (PDPTA, 2010)

Mutually independent bipanconnected property of hypercube. - Yuan-Kang Shih; Jimmy J. M. Tan; Lih-Hsing Hsu (Appl. Math. Comput., 2010)

On the extremal number of edges in hamiltonian connected graphs. - Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J. M. Tan; D. Frank Hsu; Lih-Hsing Hsu (Appl. Math. Lett., 2010)

The 3*-connected property of pyramid networks. - Yuan-Hsiang Teng; Tzu-Liang Kung; Lih-Hsing Hsu (Comput. Math. Appl., 2010)

The construction of mutually independent Hamiltonian cycles in bubble-sort graphs. - Yuan-Kang Shih; Cheng-Kuan Lin; D. Frank Hsu; Jimmy J. M. Tan; Lih-Hsing Hsu (Int. J. Comput. Math., 2010)

The panpositionable panconnectedness of augmented cubes. - Tzu-Liang Kung; Yuan-Hsiang Teng; Lih-Hsing Hsu (Inf. Sci., 2010)

Super Spanning Connectivity of the Fully Connected cubic Networks. - Cherng Chin; Huai-Chih Chen; Lih-Hsing Hsu; Shang-Chia Chiou; Kuo-Tung Lai (J. Interconnect. Networks, 2010)

On the Existence of Disjoint Spanning Paths in Faulty Hypercubes. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (J. Interconnect. Networks, 2010)

4-Ordered Hamiltonicity for Some Chordal Ring Graphs. - David Sherman; Ming Tsai; Cheng-Kuan Lin; László Lipták; Eddie Cheng 001; Jimmy J. M. Tan; Lih-Hsing Hsu (J. Interconnect. Networks, 2010)

A family of Hamiltonian and Hamiltonian connected graphs with fault tolerance. - Y-Chuang Chen; Yong-Zen Huang; Lih-Hsing Hsu; Jimmy J. M. Tan (J. Supercomput., 2010)

Embedding Cycles into Hypercubes with Prescribe Vertices in the Specific Order. - Lih-Hsing Hsu; Cheng-Kuan Lin; Jimmy J. M. Tan; Chun-Nan Hung (CSE, 2011)

Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions. - Hon-Chan Chen; Tzu-Liang Kung; Lih-Hsing Hsu (Appl. Math. Comput., 2011)

The spanning connectivity of line graphs. - Po-Yi Huang; Lih-Hsing Hsu (Appl. Math. Lett., 2011)

Mutually Independent Hamiltonian Cycle of Burnt Pancake Graphs. - Yung-Ling Lai; Da-Chung Yu; Lih-Hsing Hsu (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2011)

Fault-free mutually independent Hamiltonian cycles of faulty star graphs. - Tzu-Liang Kung; Cheng-Kuan Lin; Tyne Liang; Jimmy J. M. Tan; Lih-Hsing Hsu (Int. J. Comput. Math., 2011)

On the Extremal Number of Edges in Hamiltonian Graphs. - Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J. M. Tan; D. Frank Hsu; Lih-Hsing Hsu (J. Inf. Sci. Eng., 2011)

On 4-ordered 3-regular graphs. - Ming Tsai; Tsung-Han Tsai 006; Jimmy J. M. Tan; Lih-Hsing Hsu (Math. Comput. Model., 2011)

The g-good-neighbor conditional diagnosability of hypercube under PMC model. - Shao-Lun Peng; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu (Appl. Math. Comput., 2012)

Pancyclicity, Panconnectivity, and Panpositionability for General Graphs and Bipartite Graphs. - Shin-Shin Kao; Cheng-Kuan Lin; Hua-Min Huang; Lih-Hsing Hsu (Ars Comb., 2012)

Super Spanning Connectivity of Augmented Cubes. - Cheng-Kuan Lin; Tung-Yang Ho; Jimmy J. M. Tan; Lih-Hsing Hsu (Ars Comb., 2012)

Mutually Independent Hamiltonian Cycles in Some Graphs. - Cheng-Kuan Lin; Yuan-Kang Shih; Jimmy J. M. Tan; Lih-Hsing Hsu (Ars Comb., 2012)

Solution to an open problem on 4-ordered Hamiltonian graphs. - Lih-Hsing Hsu; Jimmy J. M. Tan; Eddie Cheng 001; László Lipták; Cheng-Kuan Lin; Ming Tsai (Discret. Math., 2012)

Component connectivity of the hypercubes. - Lih-Hsing Hsu; Eddie Cheng 001; László Lipták; Jimmy J. M. Tan; Cheng-Kuan Lin; Tung-Yang Ho (Int. J. Comput. Math., 2012)

The paths embedding of the arrangement graphs with prescribed vertices in given position. - Yuan-Hsiang Teng; Jimmy J. M. Tan; Chey-Woei Tsay; Lih-Hsing Hsu (J. Comb. Optim., 2012)

The spanning laceability on the faulty bipartite hypercube-like networks. - Cheng-Kuan Lin; Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu; Dragan Marusic (Appl. Math. Comput., 2013)

Cubic 1-fault-tolerant hamiltonian graphs, Globally 3*-connected graphs, and Super 3-spanning connected graphs. - Shin-Shin Kao; Hua-Min Huang; Kung-Ming Hsu; Lih-Hsing Hsu (Ars Comb., 2013)

Disjoint cycles in hypercubes with prescribed vertices in each cycle. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Tzu-Liang Kung (Discret. Appl. Math., 2013)

4-ordered-Hamiltonian problems of the generalized Petersen graph GP(n, 4). - Chun-Nan Hung; David Lu; Randy Jia; Cheng-Kuan Lin; László Lipták; Eddie Cheng 001; Jimmy J. M. Tan; Lih-Hsing Hsu (Math. Comput. Model., 2013)

Local Diagnosis Algorithms for Multiprocessor Systems Under the Comparison Diagnosis Model. - Cheng-Kuan Lin; Yuan-Hsiang Teng; Jimmy J. M. Tan; Lih-Hsing Hsu (IEEE Trans. Reliab., 2013)

Conditional Connectivity with Distance Requirement on Hypercube. - Liang Ma; Jianxi Fan; Lih-Hsing Hsu; Cheng-Kuan Lin (CSE, 2014)

Toward the One-to-Two Balanced Disjoint-Path Cover of Matching Composition Networks. - Tzu-Liang Kung; Hon-Chan Chen; Lih-Hsing Hsu; Chi-Lun Wang (ICS, 2014)

Conditional Fault Hamiltonicity of the Star Graph. - Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (Ars Comb., 2014)

Cycles in cube-connected cycles graphs. - Lih-Hsing Hsu; Tung-Yang Ho; Yen-Hsun Ho; Chey-Woei Tsay (Discret. Appl. Math., 2014)

Fault-tolerant hamiltonian connectivity of the WK-recursive networks. - Tung-Yang Ho; Cheng-Kuan Lin; Jimmy J. M. Tan; Lih-Hsing Hsu (Inf. Sci., 2014)

On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube. - Tzu-Liang Kung; Cheng-Kuan Lin; Lih-Hsing Hsu (J. Comb. Optim., 2014)

Conditional Matching Preclusion For The Star Graphs. - Eddie Cheng 001; László Lipták; Lih-Hsing Hsu; Jimmy J. M. Tan; Cheng-Kuan Lin (Ars Comb., 2015)

On Hamiltonian properties of unidirectional hypercubes. - Chun-Nan Hung; Eddie Cheng 001; Tao-Ming Wang; Lih-Hsing Hsu (Inf. Process. Lett., 2015)

On Developing the Learning Game for Graph Theory: A New Design Model Considering the Learners' Reflexiveness. - Meng-Chien Yang; Zi-Ting Xu; Lih-Hsing Hsu (IIAI-AAI, 2016)

A Framework of Cycle-Based Clustering on the Crossed Cube Architecture. - Tzu-Liang Kung; Chun-Nan Hung; Cheng-Kuan Lin; Hsiang-Chun Chen; Chia-Hui Lin; Lih-Hsing Hsu (IMIS, 2016)

On the Robust Approach to Data Inconsistency Detection of Sensor Networks. - Tzu-Liang Kung; Chun-Nan Hung; Yuan-Hsiang Teng; Jui-Yu Hung; Lih-Hsing Hsu (IMIS, 2016)

The Arcs Fault-Tolerance for 4-Pancyclic Properties of Unidirectional Hypercubes. - Chun-Nan Hung; Tzu-Liang Kung; Lih-Hsing Hsu; Kevin Chen; Shi Zhe Lai (ACIT/CSII/BCD, 2017)

Strong Fault-Hamiltonicity for the Crossed Cube and Its Extensions. - Chun-Nan Hung; Cheng-Kuan Lin; Lih-Hsing Hsu; Eddie Cheng 001; László Lipták (Parallel Process. Lett., 2017)

Fault-Hamiltonicity of Cartesian products of directed cycles. - Chun-Nan Hung; Tao-Ming Wang; Lih-Hsing Hsu; Eddie Cheng 001 (Art Discret. Appl. Math., 2018)

An Augmented Pancyclicity Problem of Crossed Cubes. - Hon-Chan Chen; Tzu-Liang Kung; Lih-Hsing Hsu (Comput. J., 2018)

On the spanning connectivity of the generalized Petersen graphs P(n,3). - Jeng-Jung Wang; Lih-Hsing Hsu (Discret. Math., 2018)

Theoretical analysis of shortest-path congestion unidirectional hypercubes*. - Tzu-Liang Kung; Lih-Hsing Hsu (SNPD, 2019)

2-spanning cyclability problems of the some generalized Petersen graphs. - Eddie Cheng 001; Lih-Hsing Hsu; Chun-Nan Hung; Meng-Chien Yang (Discuss. Math. Graph Theory, 2020)

The Conditional-(g, d, k)-Connectivity and Conditional-(g, d, k)-edge-Connectivity on the Hypercubes. - Cheng-Kuan Lin; Liang Ma; Jianxi Fan; Lih-Hsing Hsu; Yuan-Hsiang Teng (Fundam. Informaticae, 2020)

Three Types of Two-Disjoint-Cycle-Cover Pancyclicity and Their Applications to Cycle Embedding in Locally Twisted Cubes. - Tzu-Liang Kung; Hon-Chan Chen; Chia-Hui Lin; Lih-Hsing Hsu (Comput. J., 2021)