The consecutive-4 digraphs are Hamiltonian. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (J. Graph Theory, 1999)

Characterizing bit permutation networks. - Gerard J. Chang; Frank K. Hwang; Li-Da Tong (Networks, 1999)

On Cycle Sequences. - Ko-Wei Lih; Li-Da Tong; Jing-Ho Yan (Graphs Comb., 2001)

Channel graphs of bit permutation networks. - Li-Da Tong; Frank K. Hwang; Gerard J. Chang (Theor. Comput. Sci., 2001)

A note on the Gallai-Roy-Vitaver Theorem. - Gerard J. Chang; Li-Da Tong; Jing-Ho Yan; Hong-Gwa Yeh (Discret. Math., 2002)

The Linear 2-Arboricity of Planar Graphs. - Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang 001 (Graphs Comb., 2003)

Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability. - Frank K. Hwang; Sheng-Chyang Liaw; Li-Da Tong (IEEE Trans. Commun., 2003)

The Linear 2-Arboricity of Outerplanar Graphs. - Ko-Wei Lih; Li-Da Tong; Wei-Fan Wang 001 (Ars Comb., 2004)

Geodetic spectra of graphs. - Gerard J. Chang; Li-Da Tong; Hong-Tsu Wang (Eur. J. Comb., 2004)

Upper hamiltonian numbers and hamiltonian spectra of graphs. - Daniel Král'; Li-Da Tong; Xuding Zhu (Australas. J Comb., 2006)

On an interpolation property of outerplanar graphs. - Ko-Wei Lih; Chen-Ying Lin; Li-Da Tong (Discret. Appl. Math., 2006)

The convexity spectra of graphs. - Li-Da Tong; Pei-Lan Yen; Alastair Farrugia (Discret. Appl. Math., 2008)

Non-cover generalized Mycielski, Kneser, and Schrijver graphs. - Ko-Wei Lih; Chen-Ying Lin; Li-Da Tong (Discret. Math., 2008)

Full orientability of graphs with at most one dependent arc. - Hsin-Hao Lai; Ko-Wei Lih; Li-Da Tong (Discret. Appl. Math., 2009)

The forcing hull and forcing geodetic numbers of graphs. - Li-Da Tong (Discret. Appl. Math., 2009)

Independent arcs of acyclic orientations of complete r-partite graphs. - Gerard J. Chang; Chen-Ying Lin; Li-Da Tong (Discret. Math., 2009)

The hull and geodetic numbers of orientations of graphs. - Jung-Ting Hung; Li-Da Tong; Hong-Tsu Wang (Discret. Math., 2009)

The (a, b)-forcing geodetic graphs. - Li-Da Tong (Discret. Math., 2009)

Geodetic sets and Steiner sets in graphs. - Li-Da Tong (Discret. Math., 2009)

Full Orientability of Graphs. - Li-Da Tong (Electron. Notes Discret. Math., 2009)

Rearrangeable Nonblocking Optical Interconnection Network Fabrics With Crosstalk Constraints. - Irene Ya-Ping Chen; Li-Da Tong; Yi-Ming Huang (IEEE/ACM Trans. Netw., 2010)

A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks. - D. J. Guan; Li-Da Tong; Irene Ya-Ping Chen (BWCCA, 2012)

The minimum identifying code graphs. - André Raspaud; Li-Da Tong (Discret. Appl. Math., 2012)

Hamiltonian numbers of Möbius double loop networks. - Gerard J. Chang; Ting-Pang Chang; Li-Da Tong (J. Comb. Optim., 2012)

The hamiltonian numbers in digraphs. - Ting-Pang Chang; Li-Da Tong (J. Comb. Optim., 2013)

When is the Direct Product of Generalized Mycielskians a Cover Graph? - Hsin-Hao Lai; Ko-Wei Lih; Chen-Ying Lin; Li-Da Tong (Ars Comb., 2014)

Choice identification of a graph. - Ting-Pang Chang; Li-Da Tong (Discret. Appl. Math., 2014)

The Hamiltonian Numbers in Graphs. - Ting-Pang Chang; Li-Da Tong (Ars Comb., 2015)

Hamiltonian numbers in oriented graphs. - Li-Da Tong; Hao-Yu Yang (J. Comb. Optim., 2017)

Rearrangeability of Multicast Banyan-Type Networks with Crosstalk Constraints. - Li-Da Tong; Yun-Ruei Li (J. Interconnect. Networks, 2017)

Hamiltonian Spectra of Graphs. - Li-Da Tong; Hao-Yu Yang; Xuding Zhu (Graphs Comb., 2019)

On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. - Shinya Fujita 001; Sergey Kitaev; Shizuka Sato; Li-Da Tong (Order, 2021)