Sung, Ting-Yi; Wang, Jeng-Jung Changing the diameter of graph products. (English) Zbl 0993.05062 Wang, Jie (ed.), Computing and combinatorics. 7th annual international conference, COCOON 2001, Guilin, China, August 20-23, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2108, 390-394 (2001). MSC: 05C12 PDFBibTeX XMLCite \textit{T.-Y. Sung} and \textit{J.-J. Wang}, Lect. Notes Comput. Sci. 2108, 390--394 (2001; Zbl 0993.05062) Full Text: Link
Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi On the construction of combined \(k\)-fault-tolerant Hamiltonian graphs. (English) Zbl 0974.05051 Networks 37, No. 3, 165-170 (2001). MSC: 05C45 PDFBibTeX XMLCite \textit{C.-N. Hung} et al., Networks 37, No. 3, 165--170 (2001; Zbl 0974.05051) Full Text: DOI
Wang, Jeng-Jung; Hung, Chun-Nan; Tan, Jimmy J. M.; Hsu, Lih-Hsing; Sung, Ting-Yi Construction schemes for fault-tolerant Hamiltonian graphs. (English) Zbl 0967.68016 Networks 35, No. 3, 233-245 (2000). MSC: 68M14 68M15 90C35 05C45 68R10 PDFBibTeX XMLCite \textit{J.-J. Wang} et al., Networks 35, No. 3, 233--245 (2000; Zbl 0967.68016) Full Text: DOI
Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi Christmas tree: a versatile 1-fault-tolerant design for token rings. (English) Zbl 1338.68219 Inf. Process. Lett. 72, No. 1-2, 55-63 (1999). MSC: 68R10 05C45 68M10 68M14 68M15 PDFBibTeX XMLCite \textit{C.-N. Hung} et al., Inf. Process. Lett. 72, No. 1--2, 55--63 (1999; Zbl 1338.68219) Full Text: DOI Link
Wang, Jeng-Jung; Sung, Ting-Yi; Hsu, Lih-Hsing; Lin, Men-Yang A new family of optimal 1-Hamiltonian graphs with small diameter. (English) Zbl 0909.05035 Hsu, Wen-Lian (ed.) et al., Computing and combinatorics. 4th annual international conference, COCOON ’98, Taipei, Taiwan, ROC, August 12–14, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1449, 269-278 (1998). Reviewer: Jozef Širáň (Bratislava) MSC: 05C45 PDFBibTeX XMLCite \textit{J.-J. Wang} et al., Lect. Notes Comput. Sci. 1449, 269--278 (1998; Zbl 0909.05035)
Wang, Shih-Yih; Hsu, Lih-Hsing; Sung, Ting-Yi Faithful 1-edge fault tolerant graphs. (English) Zbl 1336.68204 Inf. Process. Lett. 61, No. 4, 173-181 (1997). MSC: 68R10 05C76 68M10 68M15 PDFBibTeX XMLCite \textit{S.-Y. Wang} et al., Inf. Process. Lett. 61, No. 4, 173--181 (1997; Zbl 1336.68204) Full Text: DOI
Hung, Chun-Nan; Hsu, Lih-Hsing; Sung, Ting-Yi The most vital edges of matching in a bipartite graph. (English) Zbl 0778.90078 Networks 23, No. 4, 309-313 (1993). MSC: 90C35 90C60 05C70 90-08 PDFBibTeX XMLCite \textit{C.-N. Hung} et al., Networks 23, No. 4, 309--313 (1993; Zbl 0778.90078) Full Text: DOI
Ho, Jan Ming; Ko, M. T.; Ma, Tze Heng; Sung, Ting Yi Algorithms for rectilinear optimal multicast tree problem. (English) Zbl 0925.05050 Ibaraki, Toshihide (ed.) et al., Algorithms and computation. 3rd international symposium, ISAAC ’92. Nagoya, Japan, December 16–18, 1992. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 650, 106-115 (1992). MSC: 05C85 68M10 68R10 90B18 PDFBibTeX XMLCite \textit{J. M. Ho} et al., Lect. Notes Comput. Sci. 650, 106--115 (1992; Zbl 0925.05050)