Li-Da Tong - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 33 from 33

2021

On Properly Ordered Coloring of Vertices in a Vertex-Weighted GraphShinya Fujita 0001, Sergey Kitaev, Shizuka Sato, Li-Da Tong. order, 38(3):515-525, 2021. [doi]

2019

Hamiltonian Spectra of GraphsLi-Da Tong, Hao-Yu Yang, Xuding Zhu. gc, 35(4):827-836, 2019. [doi]

2017

Hamiltonian numbers in oriented graphsLi-Da Tong, Hao-Yu Yang. jco, 34(4):1210-1217, 2017. [doi]

Rearrangeability of Multicast Banyan-Type Networks with Crosstalk ConstraintsLi-Da Tong, Yun-Ruei Li. join, 17(3-4):1-18, 2017. [doi]

2015

The Hamiltonian Numbers in GraphsTing-Pang Chang, Li-Da Tong. arscom, 123:151-158, 2015.

2014

Choice identification of a graphTing-Pang Chang, Li-Da Tong. DAM, 167:61-71, 2014. [doi]

When is the Direct Product of Generalized Mycielskians a Cover Graph?Hsin-Hao Lai, Ko-Wei Lih, Chen-Ying Lin, Li-Da Tong. arscom, 117:65-73, 2014.

2013

The hamiltonian numbers in digraphsTing-Pang Chang, Li-Da Tong. jco, 25(4):694-701, 2013. [doi]

2012

Hamiltonian numbers of Möbius double loop networksGerard J. Chang, Ting-Pang Chang, Li-Da Tong. jco, 23(4):462-470, 2012. [doi]

A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type NetworksD. J. Guan, Li-Da Tong, Irene Ya-Ping Chen. bwcca 2012: 289-295 [doi]

The minimum identifying code graphsAndré Raspaud, Li-Da Tong. DAM, 160(9):1385-1389, 2012. [doi]

2010

Rearrangeable Nonblocking Optical Interconnection Network Fabrics With Crosstalk ConstraintsIrene Y. Chen, Li-Da Tong, Yi-Ming Huang. ton, 18(5):1413-1421, 2010. [doi]

2009

Independent arcs of acyclic orientations of complete r-partite graphsGerard J. Chang, Chen-Ying Lin, Li-Da Tong. DM, 309(13):4280-4286, 2009. [doi]

The hull and geodetic numbers of orientations of graphsJung-Ting Hung, Li-Da Tong, Hong-Tsu Wang. DM, 309(8):2134-2139, 2009. [doi]

Full orientability of graphs with at most one dependent arcHsin-Hao Lai, Ko-Wei Lih, Li-Da Tong. DAM, 157(13):2969-2972, 2009. [doi]

The forcing hull and forcing geodetic numbers of graphsLi-Da Tong. DAM, 157(5):1159-1163, 2009. [doi]

Full Orientability of GraphsLi-Da Tong. endm, 34:669-672, 2009. [doi]

The (a, b)-forcing geodetic graphsLi-Da Tong. DM, 309(6):1623-1628, 2009. [doi]

Geodetic sets and Steiner sets in graphsLi-Da Tong. DM, 309(12):4205-4207, 2009. [doi]

2008

Non-cover generalized Mycielski, Kneser, and Schrijver graphsKo-Wei Lih, Chen-Ying Lin, Li-Da Tong. DM, 308(20):4653-4659, 2008. [doi]

The convexity spectra of graphsLi-Da Tong, Pei-Lan Yen, Alastair Farrugia. DAM, 156(10):1838-1845, 2008. [doi]

2006

Upper hamiltonian numbers and hamiltonian spectra of graphsDaniel Král', Li-Da Tong, Xuding Zhu. ajc, 35:329-340, 2006. [doi]

On an interpolation property of outerplanar graphsKo-Wei Lih, Chen-Ying Lin, Li-Da Tong. DAM, 154(1):166-172, 2006. [doi]

2004

Geodetic spectra of graphsGerard J. Chang, Li-Da Tong, Hong-Tsu Wang. ejc, 25(3):383-391, 2004. [doi]

The Linear 2-Arboricity of Outerplanar GraphsKo-Wei Lih, Li-Da Tong, Wei-Fan Wang. arscom, 73, 2004.

2003

Strictly nonblocking three-stage Clos networks with some rearrangeable multicast capabilityFrank K. Hwang, Sheng-Chyang Liaw, Li-Da Tong. tcom, 51(11):1765-1767, 2003. [doi]

The Linear 2-Arboricity of Planar GraphsKo-Wei Lih, Li-Da Tong, Wei-Fan Wang. gc, 19(2):241-248, 2003. [doi]

2002

A note on the Gallai-Roy-Vitaver TheoremGerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh. DM, 256(1-2):441-444, 2002. [doi]

2001

On Cycle SequencesKo-Wei Lih, Li-Da Tong, Jing-Ho Yan. gc, 17(1):129-133, 2001. [doi]

Channel graphs of bit permutation networksLi-Da Tong, Frank K. Hwang, Gerard J. Chang. TCS, 263(1-2):139-143, 2001. [doi]

1999

Characterizing bit permutation networksGerard J. Chang, Frank K. Hwang, Li-Da Tong. networks, 33(4):261-267, 1999. [doi]

The consecutive-4 digraphs are HamiltonianGerard J. Chang, Frank K. Hwang, Li-Da Tong. jgt, 31(1):1-6, 1999. [doi]

1997

Characterizing bit permutation networksGerard J. Chang, Frank K. Hwang, Li-Da Tong. dimacs 1998: 157-168

Sign in or sign up to see more results.

runs on WebDSL