Tong, Li-Da
46917  results:
Search for persons X
?
2

Hamiltonian Spectra of Graphs:

Tong, Li-Da ; Yang, Hao-Yu ; Zhu, Xuding
Graphs and Combinatorics.  35 (2019)  4 - p. 827-836 , 2019
 
?
3

Hamiltonian numbers in oriented graphs:

Tong, Li-Da ; Yang, Hao-Yu
Journal of Combinatorial Optimization.  34 (2017)  4 - p. 1210-1217 , 2017
 
?
4

AUTOMORPHISMS OF NEIGHBORHOOD SEQUENCE OF A GRAPH:

Tong, Li-Da
Taiwanese Journal of Mathematics.  19 (2015)  4 - p. 1085-1096 , 2015
 
?
5

Choice identification of a graph:

Chang, Ting-Pang ; Tong, Li-Da
Discrete Applied Mathematics.  167 (2014)  - p. 61-71 , 2014
 
?
6

The hamiltonian numbers in digraphs:

Chang, Ting-Pang ; Tong, Li-Da
Journal of Combinatorial Optimization.  25 (2012)  4 - p. 694-701 , 2012
 
?
7

The minimum identifying code graphs:

Raspaud, André ; Tong, Li-Da
Discrete Applied Mathematics.  160 (2012)  9 - p. 1385-1389 , 2012
 
?
8

Hamiltonian numbers of Möbius double loop networks:

Chang, Gerard J. ; Chang, Ting-Pang ; Tong, Li-Da
Journal of Combinatorial Optimization.  23 (2010)  4 - p. 462-470 , 2010
 
?
9

Rearrangeable nonblocking optical interconnection network f..:

Chen, Irene Y. ; Tong, Li-Da ; Huang, Yi-Ming
IEEE/ACM Transactions on Networking (TON).  18 (2010)  5 - p. 1413-1421 , 2010
 
?
10

Rearrangeable Nonblocking Optical Interconnection Network F..:

Chen, Irene Y. ; Tong, Li-Da ; Huang, Yi-Ming
IEEE/ACM Transactions on Networking.  18 (2010)  5 - p. 1413-1421 , 2010
 
?
11

Full orientability of graphs with at most one dependent arc:

Lai, Hsin-Hao ; Lih, Ko-Wei ; Tong, Li-Da
Discrete Applied Mathematics.  157 (2009)  13 - p. 2969-2972 , 2009
 
?
 
?
14

The forcing hull and forcing geodetic numbers of graphs:

Tong, Li-Da
Discrete Applied Mathematics.  157 (2009)  5 - p. 1159-1163 , 2009
 
?
15

The (a,b)-forcing geodetic graphs:

Tong, Li-Da
Discrete Mathematics.  309 (2009)  6 - p. 1623-1628 , 2009
 
1-15