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

2 papers · 1 filter

cs.DM2013★ 3 cited

Complexity of Coloring Graphs without Paths and Cycles

Pavol Hell, Shenwei Huang

Let $P_{t}$ and $C_{ℓ}$ denote a path on $t$ vertices and a cycle on $ℓ$ vertices, respectively. In this paper we study the $k$ -coloring problem for $(P_{t}, C_{ℓ})$ -free graphs. M…

cs.CC2013★ 23 cited

Improved Complexity Results on $k$ -Coloring $P_{t}$ -Free Graphs

Shenwei Huang

A graph is $H$ -free if it does not contain an induced subgraph isomorphic to $H$ . We denote by $P_{k}$ and $C_{k}$ the path and the cycle on $k$ vertices, respectively. In this paper,…

Complexity of Coloring Graphs without Paths and Cycles

Improved Complexity Results on k-Coloring Pt​-Free Graphs

Improved Complexity Results on $k$ -Coloring $P_{t}$ -Free Graphs