Shenwei Huang

collaborators

2 papers

math.CO2023

Vertex-Critical $(P_{5}, c hai r)$ -Free Graphs

Shenwei Huang, Zeyu Li

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

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

Vertex-Critical (P5​,chair)-Free Graphs

Critical (P5​,bull)-free graphs

Vertex-Critical $(P_{5}, c hai r)$ -Free Graphs

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