Xiaowen Zhang

collaborators

3 papers

math.CO2025

Perfect Divisibility and Coloring of Some Bull-Free Graphs

Ran Chen, Di Wu, Junran Yu +1

A graph $G$ is {\em perfectly divisible} if, for each induced subgraph $H$ of $G$ , $V (H)$ can be partitioned into $A$ and $B$ such that $H [A]$ is perfect and $ω (H [B]) < ω (H)$ . A {\em…

math.CO2025

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 $G$ , denoted by $α (G)$ , is defined as the smallest integer $q$ for which there exist positive integers $s$ and $t$ with $s +…

math.CO2024

Coloring of some $(P_{2} \cup P_{4})$ -free graphs

Chen Ran, Zhang xiaowen

We denote a path on $t$ vertices as $P_{t}$ and a cycle on $t$ vertices as $C_{t}$ . For two vertex-disjoint graphs $G_{1}$ and $G_{2}$ , the {\em union} $G_{1} \cup G_{2}$ is the graph with $V(G…

Perfect Divisibility and Coloring of Some Bull-Free Graphs

A Fan-type condition involving bipartite independence number for hamiltonicity in graphs

Coloring of some (P2​∪P4​)-free graphs

Coloring of some $(P_{2} \cup P_{4})$ -free graphs