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

3 papers · 1 filter

math.CO2021

Short proofs on $k$ -extendible graphs

Shenwei Huang, Yongtang Shi

In this note, we give short inductive proofs of two known results on $k$ -extendible graphs based on a property proved in [Qinglin Yu, A note on $n$ -extendable graphs. Journal of Gr…

math.CO2021★ 1 cited

Some Results on $k$ -Critical $P_{5}$ -Free Graphs

Qingqiong Cai, Jan Goedgebeur, Shenwei Huang

A graph $G$ is $k$ -vertex-critical if $G$ has chromatic number $k$ but every proper induced subgraph of $G$ has chromatic number less than $k$ . The study of $k$ -vertex-critical gra…

math.CO2021

Colouring graphs with no induced six-vertex path or diamond

Jan Goedgebeur, Shenwei Huang, Yiao Ju +1

The diamond is the graph obtained by removing an edge from the complete graph on 4 vertices. A graph is ( $P_{6}$ , diamond)-free if it contains no induced subgraph isomorphic to a six…

Short proofs on k-extendible graphs

Some Results on k-Critical P5​-Free Graphs

Colouring graphs with no induced six-vertex path or diamond

Short proofs on $k$ -extendible graphs

Some Results on $k$ -Critical $P_{5}$ -Free Graphs