Xia Wen

most citedCritical

(P_{5}, d a r t)

-Free Graphs

1 citations · 1 across the 2 of their papers we have counts for

collaborators

3 papers

math.CO2024

Some Results on Critical ( $P_{5}, H$ )-free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +1

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ nor $H_{2}$ . A graph $G$ is $k$ -vertex-critical if every proper i…

math.CO2023★ 1 cited

Critical $(P_{5}, d a r t)$ -Free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +1

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ nor $H_{2}$ . Let $P_{t}$ be the path on $t$ vertices. A dart is the…

math.CO2022

Critical ( $P_{5}$ ,bull)-free graphs

Shenwei Huang, Jiawei Li, Wen Xia

Given two graphs $H_{1}$ and $H_{2}$ , a graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ or $H_{2}$ . Let $P_{t}$ and $C_{t}$ be the path and the cycle on $t$ …

Some Results on Critical (P5​,H)-free Graphs

Critical (P5​,dart)-Free Graphs

Critical (P5​,bull)-free graphs

Some Results on Critical ( $P_{5}, H$ )-free Graphs

Critical $(P_{5}, d a r t)$ -Free Graphs

Critical ( $P_{5}$ ,bull)-free graphs