default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLi-Da Tong
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j31]Shinya Fujita, Sergey Kitaev
, Shizuka Sato, Li-Da Tong:
On Properly Ordered Coloring of Vertices in a Vertex-Weighted Graph. Order 38(3): 515-525 (2021)
2010 – 2019
- 2019
- [j30]Li-Da Tong, Hao-Yu Yang, Xuding Zhu:
Hamiltonian Spectra of Graphs. Graphs Comb. 35(4): 827-836 (2019) - 2017
- [j29]Li-Da Tong, Hao-Yu Yang:
Hamiltonian numbers in oriented graphs. J. Comb. Optim. 34(4): 1210-1217 (2017) - [j28]Li-Da Tong, Yun-Ruei Li:
Rearrangeability of Multicast Banyan-Type Networks with Crosstalk Constraints. J. Interconnect. Networks 17(3-4): 1741002:1-1741002:18 (2017) - 2015
- [j27]Ting-Pang Chang, Li-Da Tong:
The Hamiltonian Numbers in Graphs. Ars Comb. 123: 151-158 (2015) - 2014
- [j26]Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
When is the Direct Product of Generalized Mycielskians a Cover Graph? Ars Comb. 117: 65-73 (2014) - [j25]Ting-Pang Chang, Li-Da Tong:
Choice identification of a graph. Discret. Appl. Math. 167: 61-71 (2014) - 2013
- [j24]Ting-Pang Chang, Li-Da Tong:
The hamiltonian numbers in digraphs. J. Comb. Optim. 25(4): 694-701 (2013) - 2012
- [j23]André Raspaud, Li-Da Tong:
The minimum identifying code graphs. Discret. Appl. Math. 160(9): 1385-1389 (2012) - [j22]Gerard J. Chang, Ting-Pang Chang, Li-Da Tong:
Hamiltonian numbers of Möbius double loop networks. J. Comb. Optim. 23(4): 462-470 (2012) - [c2]D. J. Guan, Li-Da Tong, Irene Ya-Ping Chen:
A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks. BWCCA 2012: 289-295 - 2010
- [j21]Irene Ya-Ping Chen, Li-Da Tong, Yi-Ming Huang:
Rearrangeable Nonblocking Optical Interconnection Network Fabrics With Crosstalk Constraints. IEEE/ACM Trans. Netw. 18(5): 1413-1421 (2010)
2000 – 2009
- 2009
- [j20]Li-Da Tong:
The forcing hull and forcing geodetic numbers of graphs. Discret. Appl. Math. 157(5): 1159-1163 (2009) - [j19]Hsin-Hao Lai, Ko-Wei Lih, Li-Da Tong:
Full orientability of graphs with at most one dependent arc. Discret. Appl. Math. 157(13): 2969-2972 (2009) - [j18]Li-Da Tong:
The (a, b)-forcing geodetic graphs. Discret. Math. 309(6): 1623-1628 (2009) - [j17]Jung-Ting Hung, Li-Da Tong, Hong-Tsu Wang:
The hull and geodetic numbers of orientations of graphs. Discret. Math. 309(8): 2134-2139 (2009) - [j16]Li-Da Tong:
Geodetic sets and Steiner sets in graphs. Discret. Math. 309(12): 4205-4207 (2009) - [j15]Gerard J. Chang, Chen-Ying Lin, Li-Da Tong:
Independent arcs of acyclic orientations of complete r-partite graphs. Discret. Math. 309(13): 4280-4286 (2009) - [j14]Li-Da Tong:
Full Orientability of Graphs. Electron. Notes Discret. Math. 34: 669-672 (2009) - 2008
- [j13]Li-Da Tong, Pei-Lan Yen, Alastair Farrugia:
The convexity spectra of graphs. Discret. Appl. Math. 156(10): 1838-1845 (2008) - [j12]Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
Non-cover generalized Mycielski, Kneser, and Schrijver graphs. Discret. Math. 308(20): 4653-4659 (2008) - 2006
- [j11]Daniel Král', Li-Da Tong, Xuding Zhu:
Upper hamiltonian numbers and hamiltonian spectra of graphs. Australas. J Comb. 35: 329-340 (2006) - [j10]Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong:
On an interpolation property of outerplanar graphs. Discret. Appl. Math. 154(1): 166-172 (2006) - 2004
- [j9]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Outerplanar Graphs. Ars Comb. 73 (2004) - [j8]Gerard J. Chang, Li-Da Tong, Hong-Tsu Wang:
Geodetic spectra of graphs. Eur. J. Comb. 25(3): 383-391 (2004) - 2003
- [j7]Ko-Wei Lih, Li-Da Tong, Wei-Fan Wang:
The Linear 2-Arboricity of Planar Graphs. Graphs Comb. 19(2): 241-248 (2003) - [j6]Frank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong:
Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capability. IEEE Trans. Commun. 51(11): 1765-1767 (2003) - 2002
- [j5]Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh:
A note on the Gallai-Roy-Vitaver Theorem. Discret. Math. 256(1-2): 441-444 (2002) - 2001
- [j4]Ko-Wei Lih, Li-Da Tong, Jing-Ho Yan:
On Cycle Sequences. Graphs Comb. 17(1): 129-133 (2001) - [j3]Li-Da Tong, Frank K. Hwang, Gerard J. Chang:
Channel graphs of bit permutation networks. Theor. Comput. Sci. 263(1-2): 139-143 (2001)
1990 – 1999
- 1999
- [j2]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
The consecutive-4 digraphs are Hamiltonian. J. Graph Theory 31(1): 1-6 (1999) - [j1]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Networks 33(4): 261-267 (1999) - 1997
- [c1]Gerard J. Chang, Frank K. Hwang, Li-Da Tong:
Characterizing bit permutation networks. Advances in Switching Networks 1997: 157-167
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
