Ta Sheng Tan

Orcid: 0000-0002-5739-3242

According to our database1, Ta Sheng Tan authored at least 13 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Note on Hamiltonian-intersecting families of graphs.
Discret. Math., 2024

2023
Burnability of double spiders and path forests.
Appl. Math. Comput., 2023

2021
On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs.
Discret. Math., 2021

2020
Graph burning: Tight bounds on the burning numbers of path forests and spiders.
Appl. Math. Comput., 2020

2019
Rainbow Hamiltonian cycles in strongly edge-colored graphs.
Discret. Math., 2019

2018
Decomposing the complete <i>r</i>-graph.
J. Comb. Theory A, 2018

A note on rainbow matchings in strongly edge-colored graphs.
Discret. Math., 2018

Improved Bounds for the Graham-Pollak Problem for Hypergraphs.
Electron. J. Comb., 2018

2017
Lazy cops and robbers on generalized hypercubes.
Discret. Math., 2017

2016
Connected Colourings of Complete Graphs and Hypergraphs.
Graphs Comb., 2016

2015
Cycles in Oriented 3-Graphs.
Discret. Comput. Geom., 2015

2014
A Note on Large Rainbow Matchings in Edge-coloured Graphs.
Graphs Comb., 2014

2010
Traces Without Maximal Chains.
Electron. J. Comb., 2010


  Loading...