Li-Da Tong

33 papers Journal 31Unranked 2
YearRankTypeTitle / Venue / Authors
2021 J jnl
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph.
Order
Shinya Fujita, Sergey Kitaev, Shizuka Sato, Li-Da Tong
2019 J jnl
Hamiltonian Spectra of Graphs.
Graphs Comb.
Li-Da Tong, Hao-Yu Yang, Xuding Zhu
2017 J jnl
Hamiltonian numbers in oriented graphs.
J. Comb. Optim.
Li-Da Tong, Hao-Yu Yang
2017 J jnl
Rearrangeability of Multicast Banyan-Type Networks with Crosstalk Constraints.
J. Interconnect. Networks
Li-Da Tong, Yun-Ruei Li
2015 J jnl
The Hamiltonian Numbers in Graphs.
Ars Comb.
Ting-Pang Chang, Li-Da Tong
2014 J jnl
Choice identification of a graph.
Discret. Appl. Math.
Ting-Pang Chang, Li-Da Tong
2014 J jnl
When is the Direct Product of Generalized Mycielskians a Cover Graph?
Ars Comb.
Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2013 J jnl
The hamiltonian numbers in digraphs.
J. Comb. Optim.
Ting-Pang Chang, Li-Da Tong
2012 — conf
A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks.
BWCCA
D. J. Guan, Li-Da Tong, Irene Ya-Ping Chen
2012 J jnl
Hamiltonian numbers of Möbius double loop networks.
J. Comb. Optim.
Gerard J. Chang, Ting-Pang Chang, Li-Da Tong
2012 J jnl
The minimum identifying code graphs.
Discret. Appl. Math.
André Raspaud, Li-Da Tong
2010 J jnl
Rearrangeable Nonblocking Optical Interconnection Network Fabrics With Crosstalk Constraints.
IEEE/ACM Trans. Netw.
Irene Ya-Ping Chen, Li-Da Tong, Yi-Ming Huang
2009 J jnl
Full Orientability of Graphs.
Electron. Notes Discret. Math.
Li-Da Tong
2009 J jnl
Full orientability of graphs with at most one dependent arc.
Discret. Appl. Math.
Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong
2009 J jnl
Geodetic sets and Steiner sets in graphs.
Discret. Math.
Li-Da Tong
2009 J jnl
Independent arcs of acyclic orientations of complete r-partite graphs.
Discret. Math.
Gerard J. Chang, Chen-Ying Lin, Li-Da Tong
2009 J jnl
The (a, b)-forcing geodetic graphs.
Discret. Math.
Li-Da Tong
2009 J jnl
The forcing hull and forcing geodetic numbers of graphs.
Discret. Appl. Math.
Li-Da Tong
2009 J jnl
The hull and geodetic numbers of orientations of graphs.
Discret. Math.
Jung-Ting Hung, Li-Da Tong, Hong-Tsu Wang
2008 J jnl
Non-cover generalized Mycielski, Kneser, and Schrijver graphs.
Discret. Math.
Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2008 J jnl
The convexity spectra of graphs.
Discret. Appl. Math.
Li-Da Tong, Pei-Lan Yen, Alastair Farrugia
2006 J jnl
On an interpolation property of outerplanar graphs.
Discret. Appl. Math.
Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong
2006 J jnl
Upper hamiltonian numbers and hamiltonian spectra of graphs.
Australas. J Comb.
Daniel Král', Li-Da Tong, Xuding Zhu
2004 J jnl
Geodetic spectra of graphs.
Eur. J. Comb.
Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang
2004 J jnl
The Linear 2-Arboricity of Outerplanar Graphs.
Ars Comb.
Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
2003 J jnl
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability.
IEEE Trans. Commun.
Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong
2003 J jnl
The Linear 2-Arboricity of Planar Graphs.
Graphs Comb.
Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang
2002 J jnl
A note on the Gallai-Roy-Vitaver Theorem.
Discret. Math.
Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh
2001 J jnl
Channel graphs of bit permutation networks.
Theor. Comput. Sci.
Li-Da Tong, Frank K. Hwang, Gerard J. Chang
2001 J jnl
On Cycle Sequences.
Graphs Comb.
Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan
1999 J jnl
Characterizing bit permutation networks.
Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1999 J jnl
The consecutive-4 digraphs are Hamiltonian.
J. Graph Theory
Gerard J. Chang, Frank K. Hwang, Li-Da Tong
1997 — conf
Characterizing bit permutation networks.
Advances in Switching Networks
Gerard J. Chang, Frank K. Hwang, Li-Da Tong