Traces Without Maximal Chains. - Ta Sheng Tan (Electron. J. Comb., 2010)

A Note on Large Rainbow Matchings in Edge-coloured Graphs. - Allan Lo; Ta Sheng Tan (Graphs Comb., 2014)

Cycles in Oriented 3-Graphs. - Imre Leader; Ta Sheng Tan (Discret. Comput. Geom., 2015)

Connected Colourings of Complete Graphs and Hypergraphs. - Imre Leader; Ta Sheng Tan (Graphs Comb., 2016)

Lazy cops and robbers on generalized hypercubes. - Kai An Sim; Ta Sheng Tan; Kok Bin Wong (Discret. Math., 2017)

Improved Bounds for the Graham-Pollak Problem for Hypergraphs. - Imre Leader; Ta Sheng Tan (Electron. J. Comb., 2018)

A note on rainbow matchings in strongly edge-colored graphs. - Yangyang Cheng; Ta Sheng Tan; Guanghui Wang 002 (Discret. Math., 2018)

Decomposing the complete r-graph. - Imre Leader; Luka Milicevic; Ta Sheng Tan (J. Comb. Theory A, 2018)

Rainbow Hamiltonian cycles in strongly edge-colored graphs. - Yangyang Cheng; Qiang Sun; Ta Sheng Tan; Guanghui Wang 002 (Discret. Math., 2019)

Graph burning: Tight bounds on the burning numbers of path forests and spiders. - Ta Sheng Tan; Wen Chean Teh (Appl. Math. Comput., 2020)

On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs. - Zhi Yee Chng; Ta Sheng Tan; Kok Bin Wong (Discret. Math., 2021)

Burnability of double spiders and path forests. - Ta Sheng Tan; Wen Chean Teh (Appl. Math. Comput., 2023)

A Note on Hamiltonian-intersecting families of graphs. - Imre Leader; Zarko Randelovic; Ta Sheng Tan (Discret. Math., 2024)

A Note on Graph Burning of Path Forests. - Ta Sheng Tan; Wen Chean Teh (Discret. Math. Theor. Comput. Sci., 2024)