Ta Sheng Tan

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
2026 J jnl
Maximal sum-free and triangle-free sets in Z 5 k.
Discret. Math.
Zhen Yong Shin, Ta Sheng Tan, Kok Bin Wong
2026 J jnl
Odd covers of complete graphs and hypergraphs.
Eur. J. Comb.
Imre Leader, Ta Sheng Tan
2024 J jnl
A Note on Graph Burning of Path Forests.
Discret. Math. Theor. Comput. Sci.
Ta Sheng Tan, Wen Chean Teh
2024 J jnl
A Note on Hamiltonian-intersecting families of graphs.
Discret. Math.
Imre Leader, Zarko Randelovic, Ta Sheng Tan
2023 J jnl
Burnability of double spiders and path forests.
Appl. Math. Comput.
Ta Sheng Tan, Wen Chean Teh
2021 J jnl
On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs.
Discret. Math.
Zhi Yee Chng, Ta Sheng Tan, Kok Bin Wong
2020 J jnl
Graph burning: Tight bounds on the burning numbers of path forests and spiders.
Appl. Math. Comput.
Ta Sheng Tan, Wen Chean Teh
2019 J jnl
Rainbow Hamiltonian cycles in strongly edge-colored graphs.
Discret. Math.
Yangyang Cheng, Qiang Sun, Ta Sheng Tan, Guanghui Wang
2018 J jnl
A note on rainbow matchings in strongly edge-colored graphs.
Discret. Math.
Yangyang Cheng, Ta Sheng Tan, Guanghui Wang
2018 J jnl
Decomposing the complete
J. Comb. Theory A
Imre Leader, Luka Milicevic, Ta Sheng Tan
2018 J jnl
Improved Bounds for the Graham-Pollak Problem for Hypergraphs.
Electron. J. Comb.
Imre Leader, Ta Sheng Tan
2017 J jnl
Lazy cops and robbers on generalized hypercubes.
Discret. Math.
Kai An Sim, Ta Sheng Tan, Kok Bin Wong
2016 J jnl
Connected Colourings of Complete Graphs and Hypergraphs.
Graphs Comb.
Imre Leader, Ta Sheng Tan
2015 J jnl
Cycles in Oriented 3-Graphs.
Discret. Comput. Geom.
Imre Leader, Ta Sheng Tan
2014 J jnl
A Note on Large Rainbow Matchings in Edge-coloured Graphs.
Graphs Comb.
Allan Lo, Ta Sheng Tan
2010 J jnl
Traces Without Maximal Chains.
Electron. J. Comb.
Ta Sheng Tan