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

2 papers · 1 filter

math.CO2022

The optimal $χ$ -bound for $(P_{7}, C_{4}, C_{5})$ -free graphs

Shenwei Huang

In this paper, we give an optimal $χ$ -binding function for the class of $(P_{7}, C_{4}, C_{5})$ -free graphs. We show that every $(P_{7}, C_{4}, C_{5})$ -free graph $G$ has $χ(G)\le \lceil \frac{11}…

math.CO2022

Coloring ( $P_{5}$ , kite)-free graphs

Shenwei Huang, Yiao Ju, T. Karthick

Let $P_{n}$ and $K_{n}$ denote the induced path and complete graph on $n$ vertices, respectively. The {\em kite} is the graph obtained from a $P_{4}$ by adding a vertex and making it adj…

The optimal χ-bound for (P7​,C4​,C5​)-free graphs

Coloring (P5​, kite)-free graphs

The optimal $χ$ -bound for $(P_{7}, C_{4}, C_{5})$ -free graphs

Coloring ( $P_{5}$ , kite)-free graphs