Lizhong Chen

collaborators

2 papers

math.CO2025

Optimal chromatic bound for ( $P_{2} \cup P_{4}$ , HVN)-free graphs

Lizhong Chen, Hongyang Wang

The HVN is a graph formed by removing two edges incident to the same vertex from the complete graph $K_{5}$ . In this paper, we prove that every ( $P_{2} \cup P_{4}$ , HVN)-free graph $G$ sa…

math.CO2025

Perfect divisions in ( $P_{2} \cup P_{4}$ , bull)-free graphs

Lizhong Chen, Hongyang Wang

A graph $G$ has a perfect division if its vertex set can be partitioned into two sets $A$ , $B$ such that $G [A]$ is perfect and $ω (G [B]) < ω (G)$ . We call $G$ perfectly divisible if…

Optimal chromatic bound for (P2​∪P4​, HVN)-free graphs

Perfect divisions in (P2​∪P4​, bull)-free graphs

Optimal chromatic bound for ( $P_{2} \cup P_{4}$ , HVN)-free graphs

Perfect divisions in ( $P_{2} \cup P_{4}$ , bull)-free graphs