- Lih-Hsing Hsu, Rong-Hong Jan, Yu-Che Lee, Chun-Nan Hung, and Maw-Sheng Chern, Finding the Most Vital Edge with respect to Minimum Spanning Tree in Weighted Graphs, Information Processing Letters, Vol.39 (1991), pp.277-281.
- Chun-Nan Hung, Lih-Hsing Hsu, and Ting-Yi Sung, The Most Vital Edges of Matching in a Bipartite Graph, Networks, Vol.23, 4, 1993, pp.309-313.
- Chun-Nan Hung, Lih-Hsing Hsu, Ting-Yi Sung, and Chang-Hsiung Tsai, On the Equivalence of Butterfly Graphs and a Class of Cayley Graphs (accepted by IEEE Trans. On Parallel and Distributed Systems but without publishing since a same result published early).
- Jeng-Jung Wang, Chun-Nan Hung, and Lih-Hsing Hsu, Optimal 1-hamiltonian graphs, Information Processing Letters, Vol.65, 1998, pp. 157-161.
- Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, Christmas Tree: A Versatile 1-Fault-Tolerant Design for Token Rings, accepted by Information Processing Letters (a preliminary version also appeared in 1998 International Conference on Parallel and Distributed Systems, pp. 383-388).
- Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, On the Construction of Combined k-Fault Tolerant Hamiltonian Graphs, accepted by Networks(a preliminary version also appeared in 1998 International Computer Symposium Workshop on Algorithm, pp.1-5).
- Chang-Hsiung Tsai, Chun-Nan Hung, Lih-Hsing Hsu, and Chung-Haw Chang, The Correct Diameter of Trivalent Cayley Graphs, submitted to Information Processing Letters.
- Wen-Tzeng Huang, Jimmy J. M. Tan, Chun-Nan Hung, and Lih-Hsing Hsu, Fault-Tolerant Hamiltonicity of Twisted Cubes, submitted to Information Science.
- Chun-Nan Hung, Lih-Hsing Hsu and Ting-Yi Sung, On the Isomorphism between Omega Networks and Cyclic-Cubes, summitted to IEEE Transaction on Parallel and Distributed Systems.
|