8 papers
Vertex-distinguishing chromatic index of digraphs
Yuping Gao, Zijun Qin, Songling Shan
Let be a digraph. In this note, an \emph{arc coloring} of is an assignment of colors to the arcs of such that no two arcs with a common tail receive the same color and…
Long antipaths in oriented graphs
Yuping Gao, Allan Lo
An antidirected path is an oriented path in which every vertex sees either just incoming or just outgoing edges. We prove that every oriented graph with minimum semidegree at least…
An Ore-type condition for -tilings in graphs
Yuping Gao, Yilin Guo, Guanghui Wang +1
A graph admits an -tiling if it contains a collection of vertex-disjoint copies of . In this paper, we confirm a conjecture proposed by Kühn, Osthus, and Treglown by sho…
Equitable tree colouring of graphs
Yuping Gao, Allan Lo, Songling Shan
Let and let be a simple graph with maximum degree . A -colouring of is an assignment of colours from to the vertices of $G…
Linear arboricity of robust expanders
Yuping Gao, Songling Shan
In 1980, Akiyama, Exoo, and Harary conjectured that any graph can be decomposed into at most linear forests. We confirm the conjecture for robust expa…
A sufficient condition for a hypergraph to have a Berge--factor
Yuping Gao, Songling Shan, Gexin Yu
For any graph (hypergraph) with vertex set and edge set , we define its incidence bipartite graph as the bipartite graph with bipartition , wher…