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

3 papers · 1 filter

math.CO2020★ 1 cited

Some extremal results on the chromatic-stability index

Shenwei Huang, Sandi Klavžar, Hui Lei +2

The $χ$ -stability index $es_{χ} (G)$ of a graph $G$ is the minimum number of its edges whose removal results in a graph with the chromatic number smaller than that of $G$ . In th…

math.CO2020★ 1 cited

$k$ -Critical Graphs in $P_{5}$ -Free Graphs

Kathie Cameron, Jan Goedgebeur, Shenwei Huang +1

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}$ . Let $P_{t}$ be the path on $t$ vertices. A graph $G…

cs.DS2020★ 2 cited

Complexity of $C_{k}$ -coloring in hereditary classes of graphs

Maria Chudnovsky, Shenwei Huang, Paweł Rzążewski +2

For a graph $F$ , a graph $G$ is \emph{ $F$ -free} if it does not contain an induced subgraph isomorphic to $F$ . For two graphs $G$ and $H$ , an \emph{ $H$ -coloring} of $G$ is a mapping…

Some extremal results on the chromatic-stability index

k-Critical Graphs in P5​-Free Graphs

Complexity of Ck​-coloring in hereditary classes of graphs

$k$ -Critical Graphs in $P_{5}$ -Free Graphs

Complexity of $C_{k}$ -coloring in hereditary classes of graphs