1 citations · 1 across the 4 of their papers we have counts for
6 papers
Erdős-Gyárfás Conjecture for -free graphs
Yuping Gao, Songling Shan
A graph is -free if it contains no induced subgraph isomorphic to the path on eight vertices. In 1995, Erdős and Gyárfás conjectured that every graph of minimum degree a…
Hamiltonian cycles in 7-tough -free graphs
Yuping Gao, Songling Shan
The toughness of a noncomplete graph is the maximum real number such that the ratio of to the number of components of is at least for every cutset of $G…
Antimagic orientation of lobsters
Yuping Gao, Songling Shan
Let be an integer and be a graph with edges. We say that has an antimagic orientation if has an orientation and a bijection $τ:A(D)\rightarrow \{1,2,\c…
The edge colorings of -minor free graphs
Jieru Feng, Yuping Gao, Jianliang Wu
In 1965, Vizing proved that every planar graph with maximum degree is edge -colorable. It is also proved that every planar graph with maximum degree is e…
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…
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…