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 2023Show all

2 papers · 1 filter

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.CO2023

Near Optimal Colourability on Hereditary Graph Families

Yiao Ju, Shenwei Huang

In this paper, we initiate a systematic study on a new notion called near optimal colourability which is closely related to perfect graphs and the Lov{á}sz theta function. A graph…

Critical (P5​,dart)-Free Graphs

Near Optimal Colourability on Hereditary Graph Families

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