Xiaowen Zhang

activity

20242026

collaborators

Showing 2025Show all

3 papers · 1 filter

math.CO2025

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

Ran Chen, Di Wu, Junran Yu +1

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

math.CO2025

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

Di Wu, Xiaowen Zhang

Goedgebeur and Schaudt [J. Graph Theory 87 (2018), 188-207] conjectured that every $4$ -vertex-critical $(P_{7}, C_{3})$ -free graph belongs to a family of seven explicitly defined graphs…

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 +…

On Perfect Divisibility of Bull-Free Graphs Without Long Paths

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

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

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