1 citations · 1 across the 5 of their papers we have counts for
5 papers
Bounded chromatic number of graphs with small clique number and large minimum degree
Jiaao Li, Xinyuan Li
We prove that every triangle-free graph with minimum degree at least is -colorable and thereby settle a problem of Brandt and Thomassé (2005) at the threshold $\fr…
B-coloring of grid graphs
Zhengxu Jiang, Jiaao Li
A B-coloring of a graph is a proper edge-coloring in which every -cycle is rainbow. Let be the minimum number of colors in such a coloring. Gyárfás and Sárközy (202…
A local clique density theorem in -free graphs
Jiaao Li, Xinyuan Li, Yan Wang +1
In 2016, Reiher's clique density theorem determined the minimum number of copies of in a graph with a prescribed edge density. In this paper, we investigate its local version…
Spanning Triangle-trees and Flows of Graphs
Jiaao Li, Xueliang Li, Meiling Wang
In this paper we study the flow-property of graphs containing a spanning triangle-tree. Our main results provide a structure characterization of graphs with a spanning triangle-tre…
Complementary Graphs with Flows Less Than Three
Jiaao Li, Xueliang Li, Meiling Wang
X. Hou, H.-J. Lai, P. Li and C.-Q. Zhang [J. Graph Theory 69 (2012) 464-470] showed that for a simple graph with , if , then either …