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

Showing 2021Show all

2 papers · 1 filter

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…

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

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

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

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