1 citations · 1 across the 3 of their papers we have counts for
4 papers · 1 filter
An exact Ore-degree condition for Hamilton cycles in oriented graphs
Yulin Chang, Yangyang Cheng, Tianjiao Dai +2
An oriented graph is a digraph that contains no 2-cycles, i.e., there is at most one arc between any two vertices. We show that every oriented graph of sufficiently large order…
New bounds for proper -conflict-free colourings
Quentin Chuet, Tianjiao Dai, Qiancheng Ouyang +1
A proper -colouring of a graph is called -conflict-free if every vertex has at least colours appearing exactly once in its neighbourhood.…
Independent transversal blow-up of graphs
Tianjiao Dai, Weichan Liu, Xin Zhang
In an -partite graph, an independent transversal of size (ITS) consists of vertices from each part forming an independent set. Motivated by a question from Bollobás, Erd…
New bounds for odd colourings of graphs
Tianjiao Dai, Qiancheng Ouyang, François Pirot
Given a graph , a vertex-colouring of , and a subset , a colour is said to be \emph{odd} for in if it has an odd number of occurrenc…