6 papers
Turán numbers of triangular pyramids
Chuanqi Xiao, Long-Tu Yuan, Xiaowen Zhang
Let $\TP_k$ denote the triangular pyramid with layers. For a graph family , let $\ex(n,\mathcal F)$ be the maximum number of edges in an -vertex graph containing…
On Perfect Divisibility of Bull-Free Graphs Without Long Paths
Ran Chen, Di Wu, Junran Yu +1
A graph is {\em perfectly divisible} if, for every induced subgraph of , can be partitioned into and such that is perfect and . Chudn…
Structure, Coloring, and Perfect Divisibility of -Free Graphs
Di Wu, Xiaowen Zhang
Goedgebeur and Schaudt [J. Graph Theory 87 (2018), 188-207] conjectured that every -vertex-critical -free graph belongs to a family of seven explicitly defined graphs…
A Fan-type condition involving bipartite independence number for hamiltonicity in graphs
Hongxi Liu, Long-Tu Yuan, Xiaowen Zhang
The bipartite independence number of a graph , denoted by , is defined as the smallest integer for which there exist positive integers and with $s +…
Coloring of some -free graphs
Chen Ran, Zhang xiaowen
We denote a path on vertices as and a cycle on vertices as . For two vertex-disjoint graphs and , the {\em union} is the graph with $V(G…
Coloring some -free graphs with colors
Ran Chen, Di Wu, Xiaowen Zhang
The Borodin-Kostochka Conjecture states that for a graph , if , then . We use and to denote a path and a cycle on vertice…