52 citations · 76 across the 8 of their papers we have counts for
8 papers
A finite forbidden family with superlinear surplus and non-join extremal graphs
Chuandong Xu
We give a common counterexample to two product-structure conjectures in extremal graph theory. More precisely, we construct a fixed nonempty finite family with $p(\mat…
A finite forbidden family with superlinear surplus and no three-factor product extremizers
Chuandong Xu
We construct a fixed finite family of ordinary forbidden subgraphs with and a constant such that at every…
Cooperative coloring of some graph families
Xuqing Bai, Bi Li, Chuandong Xu +1
In a family of graphs sharing the same vertex set , a cooperative coloring involves selecting one independent set from for each $i\in \{1,2…
Properly colored 's in edge-colored graphs
Chuandong Xu, Colton Magnant, Shenggui Zhang
When many colors appear in edge-colored graphs, it is only natural to expect rainbow subgraphs to appear. This anti-Ramsey problem has been studied thoroughly and yet there remain…
On characterizing the critical graphs for matching Ramsey numbers
Chuandong Xu, Hongna Yang, Shenggui Zhang
Given simple graphs , the Ramsey number is the smallest positive integer such that every edge-colored with c…
On sufficient conditions for rainbow cycles in edge-colored graphs
Shinya Fujita, Bo Ning, Chuandong Xu +1
Let be an edge-colored graph. We use and to denote the number of edges of and the number of colors appearing on , respectively. For a vertex …
Rainbow triangles in edge-colored graphs
Binlong Li, Bo Ning, Chuandong Xu +1
Let be an edge-colored graph. The color degree of a vertex of , is defined as the number of colors of the edges incident to . The color number of is defined as th…
Extreme tenacity of graphs with given order and size
T. C. E. Cheng, Yinkui Li, Chuandong Xu +1
Computer or communication networks are so designed that they do not easily get disrupted under external attack and, moreover, these are easily reconstructible if they do get disrup…