5 citations · 8 across the 5 of their papers we have counts for
7 papers
Exact rainbow numbers for matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi +1
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Extremal -free planar graphs
Yongxin Lan, Yongtang Shi, Zi-Xia Song
Given a graph , a graph is -free if it does not contain as a subgraph. We continue to study the topic of "extremal" planar graphs, that is, how many edges can an -free…
Planar anti-Ramsey numbers of matchings
Gang Chen, Yongxin Lan, Zi-Xia Song
Given a positive integer and a planar graph , let be the family of all plane triangulations on vertices such that contains a subgraph isomorph…
Improved bounds for rainbow numbers of matchings in plane triangulations
Zhongmei Qin, Yongxin Lan, Yongtang Shi
Given two graphs and , the {\it rainbow number} for with respect to is defined as the minimum number such that any -edge-coloring of contains a…
Degree powers in graphs with a forbidden forest
Yongxin Lan, Henry Liu, Zhongmei Qin +1
Given a positive integer and a graph with degree sequence , we define . Caro and Yuster introduced a Turán-type problem for $e_p(G…
The Turan number of 2P_7
Yongxin Lan, Zhongmei Qin, Yongtang Shi
The Turán number of a graph , denoted by , is the maximum number of edges in any graph on vertices which does not contain as a subgraph. Let denote the…