The following pages link to Ta Sheng Tan (Q251533):
Displaying 25 items.
- Lazy Cops and Robbers on generalized hypercubes (Q526267) (← links)
- On the burning number of generalized Petersen graphs (Q723638) (← links)
- A note on large rainbow matchings in edge-coloured graphs (Q742578) (← links)
- Cycles in oriented 3-graphs (Q894680) (← links)
- A note on rainbow matchings in strongly edge-colored graphs (Q1660260) (← links)
- Decomposing the complete \(r\)-graph (Q1679321) (← links)
- Improved bounds for the Graham-Pollak problem for hypergraphs (Q1691097) (← links)
- Rainbow Hamiltonian cycles in strongly edge-colored graphs (Q1727799) (← links)
- On the Ramsey numbers for the tree graphs versus certain generalised wheel graphs (Q2032861) (← links)
- A note on on-line Ramsey numbers of stars and paths (Q2049035) (← links)
- Burnability of double spiders and path forests (Q2096325) (← links)
- Traces without maximal chains (Q2380427) (← links)
- Graph burning: tight bounds on the burning numbers of path forests and spiders (Q2657308) (← links)
- Tiling with arbitrary tiles (Q3186407) (← links)
- DIRECTED SIMPLICES IN HIGHER ORDER TOURNAMENTS (Q3406664) (← links)
- The Brush Number of the Two-Dimensional Torus (Q4604118) (← links)
- (Q4614817) (← links)
- (Q5033249) (← links)
- Connected colourings of complete graphs and hypergraphs (Q5964989) (← links)
- Galois groups of certain even octic polynomials (Q6087904) (← links)
- A Note on Graph Burning of Path Forests (Q6515089) (← links)
- The Ramsey numbers for trees of order $n$ with maximum degree at least $n-5$ versus the wheel graph of order nine (Q6524625) (← links)
- The Ramsey numbers for trees of large maximum degree versus the wheel graph \(W_8\) (Q6587103) (← links)
- A note on Hamiltonian-intersecting families of graphs (Q6589139) (← links)
- Odd Covers of Complete Graphs and Hypergraphs (Q6739907) (← links)
