Xiaowen Zhang

activity

20242026

collaborators

4 papers

math.CO2026

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 $I ¨ (H [B]) < I ¨ (H)$ . A {\…

math.CO2026

Structure, Perfect Divisibility and Coloring of ( $P_{2} \cup P_{4}, C_{3}$ )-Free Graphs

Ran Chen, Di Wu, Xiaowen Zhang

Goedgebeur and Schaudt [J. Graph Theory 87 (2018) 188-207] conjectured that all 4-vertex-critical $(P_{7}, C_{3})$ -free graphs belongs to the family $G$ , which consists of seven ex…

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 $I^\pm (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

Structure, Perfect Divisibility and Coloring of (P2​∪P4​,C3​)-Free Graphs

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

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

Structure, Perfect Divisibility and Coloring of ( $P_{2} \cup P_{4}, C_{3}$ )-Free Graphs

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