23 citations · 70 across the 16 of their papers we have counts for
16 papers
Ramsey multiplicity for ordered graphs
Mengya He, Yaping Mao, Bing Wei +1
Let \(\cG_1,\ldots,\cG_k\) be fixed vertex-ordered graphs, each containing at least one edge. The ordered Ramsey number \(\oR(\cG_1,\ldots,\cG_k)\) is the least integer \(N\) such…
Some exact values on Ramsey numbers related to fans
Qinghong Zhao, Bing Wei
For two given graphs and , the Ramsey number is the smallest integer such that any red-blue edge-coloring of the complete graph contains a red or a bl…
a characterization of the centers of chordal graphs
James M Shook, Bing Wei
A graph is -chordal if it does not have an induced cycle with length greater than . We call a graph chordal if it is -chordal. Let be a graph. The distance between the…
Bonds intersecting long paths in -connected graphs
Bing Wei, Haidong Wu, Qinghong Zhao
A well-known question of Gallai (1966) asked whether there is a vertex which passes through all longest paths of a connected graph. Although this has been verified for some special…
Gallai-Ramsey numbers for graphs with five vertices of chromatic number four
Qinghong Zhao, Bing Wei
Given a graph and an integer , the Gallai-Ramsey number is defined to be the minimum integer such that every -edge coloring of contains either a r…
Gallai-Ramsey numbers for graphs with chromatic number three
Qinghong Zhao, Bing Wei
Given a graph and an integer , the Gallai-Ramsey number is defined to be the minimum integer such that every -edge coloring of the complete graph …