English  |  正體中文  |  简体中文  |  2817768  
???header.visitor??? :  27900087    ???header.onlineuser??? :  1227
???header.sponsordeclaration???
 
臺灣學術機構典藏系統 (Taiwan Academic Institutional Repository, TAIR)
???ui.leftmenu.abouttair???

???ui.leftmenu.bartitle???

???index.news???

???ui.leftmenu.copyrighttitle???

???ui.leftmenu.link???

"l d tong"???jsp.browse.items-by-author.description???

???jsp.browse.items-by-author.back???
???jsp.browse.items-by-author.order1??? ???jsp.browse.items-by-author.order2???

Showing items 1-18 of 18  (1 Page(s) Totally)
1 
View [10|25|50] records per page

Institution Date Title Author
國立中山大學 2009 The independent arcs of acyclic orientations of complete r-partite graphs G.J. Chang;C.Y. Lin;L.D. Tong
國立中山大學 2009 Full orientability of graphs with at most one dependent arc H.H. Lai;K.W. Lih;L.D. Tong
國立中山大學 2006 The convexity spectra of graphs L.D. Tong; P.L. Yen;A. Farrugia
國立中山大學 2006 Upper Hamiltonian numbers and Hamiltonian spectra of graphs D. Kral;L.D. Tong; X. Zhu
國立中山大學 2006 On an interpolation property of outerplanar graphs K.W. Lih;C.Y. Lin; L.D. Tong
國立中山大學 2006 Non-cover generalized Mycielskian, Kneser, and Schrijver graphs K.W. Lih;C.Y. Lin; L.D. Tong
國立中山大學 2004 The linear 2-arboricity of outerplanar graphs K.W. Lih;L.D. Tong;W.F. Wang
國立中山大學 2004 Geodetic spectra of graphs G.J. Chang; L.D. Tong; H.T. Wang
國立中山大學 2003 Strictly nonblocking 3-stage clos networks with some rearrangeable multicast capability. F.K. Hwang;S.C. Liaw;L.D. Tong
國立中山大學 2003 The linear 2-arboricity of planar graphs K.W. Lih;L.D. Tong;W. Wang
國立中山大學 2002 A note on Gallai-Roy-Vitaver theorem G.J. Chang; L.D. Tong; J.H. Yan; H.G. Yeh
國立臺灣大學 2002 A note on Gallai-Roy-Vitaver Theorem 張鎮華; L.D. Tong; J.H. Yan; Yeh, H.G.; Chang, G.J.; L.D. Tong; J.H. Yan; Yeh, H.G.
國立中山大學 2001 On cycle sequences K.W. Lih;L.D. Tong;J.H. Yan
國立中山大學 2001 Channel graphs of bit permutation networks L.D. Tong; F.K. Hwang; G.J. Chang
國立中山大學 2000 Trees with the minimum Wiener numbers S.C. Liu;L.D. Tong;Y.N. Yeh
國立中山大學 1999 Characterizing bit permutation networks G.J. Chang; F.K. Hwang; L.D. Tong
國立中山大學 1999 The consecutive-4 digraphs are hamiltonian G.J. Chang;F.K. Hwang; L.D. Tong
國立中山大學 1997 The Hamiltonian properties of consecutive-3 digraphs G.J. Chang; F.K. Hwang; L.D. Tong

Showing items 1-18 of 18  (1 Page(s) Totally)
1 
View [10|25|50] records per page