Yuping Gao

activity

20162026

most citedNonempty intersection of longest paths in graphs without forbidden pairs

2 citations · 6 across the 13 of their papers we have counts for

collaborators

15 papers

math.CO2026

Vertex-distinguishing chromatic index of digraphs

Yuping Gao, Zijun Qin, Songling Shan

Let $D$ be a digraph. In this note, an \emph{arc coloring} of $D$ is an assignment of colors to the arcs of $D$ such that no two arcs with a common tail receive the same color and…

math.CO2026

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…

math.CO2026

An Ore-type condition for $H$ -tilings in graphs

Yuping Gao, Yilin Guo, Guanghui Wang +1

A graph $G$ admits an $H$ -tiling if it contains a collection of vertex-disjoint copies of $H$ . In this paper, we confirm a conjecture proposed by Kühn, Osthus, and Treglown by show…

math.CO2026

Equitable tree colouring of graphs

Yuping Gao, Allan Lo, Songling Shan

Let $k \in N$ and let $G$ be a simple graph with maximum degree $Δ$ . A $k$ -colouring $φ$ of $G$ is an assignment of colours from ${1, 2, \dots, k}$ to the vertices of $G$ .…

math.CO2025

Vertex-distinguishing edge coloring of graphs

Yuping Gao, Songling Shan, Guanghui Wang +1

Let $k \geq 1$ be an integer and let $G$ be a nonempty simple graph. An \emph{edge- $k$ -coloring} $φ$ of $G$ is an assignment of colors from ${1, \dots, k}$ to the edges of $G$ such…

math.CO2024

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs

Yuping Gao, Songling Shan, Guanghui Wang

Given an integer $k \geq 1$ , an edge- $k$ -coloring of a graph $G$ is an assignment of $k$ colors $1, \dots, k$ to the edges of $G$ such that no two adjacent edges receive the same color…

math.CO2024

Linear arboricity of robust expanders

Yuping Gao, Songling Shan

In 1980, Akiyama, Exoo, and Harary conjectured that any graph $G$ can be decomposed into at most $⌈(Δ (G) + 1) /2 ⌉$ linear forests. We confirm the conjecture for robust expan…

math.CO2023

A sufficient condition for a hypergraph to have a Berge- $k$ -factor

Yuping Gao, Songling Shan, Gexin Yu

For any graph (hypergraph) $G$ with vertex set $V$ and edge set $E$ , we define its incidence bipartite graph $I (G)$ as the bipartite graph with bipartition $(E, V)$ , wher…

math.CO2021

Erdős-Gyárfás Conjecture for $P_{8}$ -free graphs

Yuping Gao, Songling Shan

A graph is $P_{8}$ -free if it contains no induced subgraph isomorphic to the path $P_{8}$ on eight vertices. In 1995, Erdős and Gyárfás conjectured that every graph of minimum degree a…

math.CO2021

Hamiltonian cycles in 7-tough $(P_{3} \cup 2 P_{1})$ -free graphs

Yuping Gao, Songling Shan

The toughness of a noncomplete graph $G$ is the maximum real number $t$ such that the ratio of $∣ S ∣$ to the number of components of $G - S$ is at least $t$ for every cutset $S$ of $G…

math.CO2020

Antimagic orientation of lobsters

Yuping Gao, Songling Shan

Let $m \geq 1$ be an integer and $G$ be a graph with $m$ edges. We say that $G$ has an antimagic orientation if $G$ has an orientation $D$ and a bijection $τ:A(D)\rightarrow \{1,2,\c…

math.CO2020★ 1 cited

The edge colorings of $K_{5}$ -minor free graphs

Jieru Feng, Yuping Gao, Jianliang Wu

In 1965, Vizing proved that every planar graph $G$ with maximum degree $Δ \geq 8$ is edge $Δ$ -colorable. It is also proved that every planar graph $G$ with maximum degree $Δ = 7$ is e…

math.CO2019★ 2 cited

Nonempty intersection of longest paths in graphs without forbidden pairs

Yuping Gao, Songling Shan

In 1966, Gallai asked whether all longest paths in a connected graph have a nonempty intersection. The answer to this question is not true in general and various counterexamples ha…

math.CO2019★ 1 cited

Equitable partition of plane graphs with independent crossings into induced forests

Bei Niu, Xin Zhang, Yuping Gao

The cluster of a crossing in a graph drawing in the plane is the set of the four end-vertices of its two crossed edges. Two crossings are independent if their clusters do not inter…

math.CO2016★ 2 cited

Chromatic index determined by fractional chromatic index

Guantao Chen, Yuping Gao, Ringi Kim +2

Given a graph $G$ possibly with multiple edges but no loops, denote by $Δ$ the {\it maximum degree}, $μ$ the {\it multiplicity}, $χ^{'}$ the {\it chromatic index} and $χ_{f}^{'}$ the {\it…

Vertex-distinguishing chromatic index of digraphs

Long antipaths in oriented graphs

An Ore-type condition for H-tilings in graphs

Equitable tree colouring of graphs

Vertex-distinguishing edge coloring of graphs

Vertex-distinguishing and sum-distinguishing edge coloring of regular graphs

Linear arboricity of robust expanders

A sufficient condition for a hypergraph to have a Berge-k-factor

Erdős-Gyárfás Conjecture for P8​-free graphs

Hamiltonian cycles in 7-tough (P3​∪2P1​)-free graphs

Antimagic orientation of lobsters

The edge colorings of K5​-minor free graphs

Nonempty intersection of longest paths in graphs without forbidden pairs

Equitable partition of plane graphs with independent crossings into induced forests

Chromatic index determined by fractional chromatic index

An Ore-type condition for $H$ -tilings in graphs

A sufficient condition for a hypergraph to have a Berge- $k$ -factor

Erdős-Gyárfás Conjecture for $P_{8}$ -free graphs

Hamiltonian cycles in 7-tough $(P_{3} \cup 2 P_{1})$ -free graphs

The edge colorings of $K_{5}$ -minor free graphs