Shenwei Huang

activity

20132026

most citedImproved Complexity Results on

k

-Coloring

P_{t}

-Free Graphs

23 citations · 59 across the 29 of their papers we have counts for

collaborators

Showing 2025Show all

2 papers · 1 filter

math.CO2025

3-Coloring $P_{t}$ -Free Graphs With Only One Prescribed Induced Odd Cycle Length

Yidong Zhou, Mingxian Zhong, Shenwei Huang

A graph is $P_{t}$ -free if it contains no induced subgraph isomorphic to a $t$ -vertex path. A graph is not bipartite if and only if it contains an induced subgraph isomorphic to a $k…

math.CO2025

Critical $(P_{5}, W_{4})$ -Free Graphs

Wen Xia, Jorik Jooken, Jan Goedgebeur +3

A graph $G$ is $k$ -vertex-critical if $χ (G) = k$ but $χ (G - v) < k$ for all $v \in V (G)$ . A graph is $(H_{1}, H_{2})$ -free if it contains no induced subgraph isomorphic to $H_{1}$ nor $H_{2}$ .…

3-Coloring Pt​-Free Graphs With Only One Prescribed Induced Odd Cycle Length

Critical (P5​,W4​)-Free Graphs

3-Coloring $P_{t}$ -Free Graphs With Only One Prescribed Induced Odd Cycle Length

Critical $(P_{5}, W_{4})$ -Free Graphs