Improved complexity results on k-coloring Pt-free graphs S Huang European Journal of Combinatorics 51, 336-346, 2016 | 41 | 2016 |

Complexity of coloring graphs without paths and cycles P Hell, S Huang Discrete Applied Mathematics 216, 211-232, 2017 | 29 | 2017 |

Improved Complexity Results on *k*-Coloring *P* _{ t }-Free GraphsS Huang International Symposium on Mathematical Foundations of Computer Science, 551-558, 2013 | 26 | 2013 |

Bounding clique-width via perfect graphs KK Dabrowski, S Huang, D Paulusma Journal of Computer and System Sciences, 2016 | 19 | 2016 |

Narrowing the Complexity Gap for Colouring (*C*_{s}, P_{t})-Free GraphsS Huang, M Johnson, D Paulusma The Computer Journal 58 (11), 3074-3088, 2015 | 19 | 2015 |

Structure and algorithms for (cap, even hole)-free graphs K Cameron, MVG da Silva, S Huang, K Vušković Discrete Mathematics 341 (2), 463-473, 2018 | 12 | 2018 |

Bounding the clique-width of H-free split graphs A Brandstädt, KK Dabrowski, S Huang, D Paulusma Discrete Applied Mathematics 211, 30-39, 2016 | 12 | 2016 |

Bounding the Clique-Width of *H*-free Chordal GraphsA Brandstädt, KK Dabrowski, S Huang, D Paulusma International Symposium on Mathematical Foundations of Computer Science, 139-150, 2015 | 11 | 2015 |

Bounding the Clique‐Width of *H*‐Free Chordal GraphsA Brandstädt, KK Dabrowski, S Huang, D Paulusma Journal of Graph Theory 86 (1), 42-77, 2017 | 9 | 2017 |

Linearly -Bounding (P6,C4)-Free Graphs S Gaspers, S Huang International Workshop on Graph-Theoretic Concepts in Computer Science, 263-274, 2017 | 6 | 2017 |

Colouring square-free graphs without long induced paths S Gaspers, S Huang, D Paulusma arXiv preprint arXiv:1805.08270, 2018 | 5 | 2018 |

Bounding the clique-width of H-free split graphs A Brandstädt, KK Dabrowski, S Huang, D Paulusma Electronic Notes in Discrete Mathematics 49, 497-503, 2015 | 5 | 2015 |

Paired-domination in claw-free graphs S Huang, L Kang, E Shan Graphs and Combinatorics 29, 1777-1794, 2013 | 4 | 2013 |

A note on the upper bound for the paired-domination number of a graph with minimum degree at least two S Huang, E Shan Networks 57, 115-116, 2011 | 3 | 2011 |

-Free Graphs are 4-Colorable S Gaspers, S Huang SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019 | 1 | 2019 |

Critical (P6, banner)-free graphs S Huang, T Li, Y Shi Discrete Applied Mathematics 258, 143-151, 2019 | 1 | 2019 |

An Optimal -Bound for (, diamond)-Free Graphs K Cameron, S Huang, O Merkel arXiv preprint arXiv:1809.00739, 2018 | 1 | 2018 |

List-three-coloring graphs with no induced M Chudnovsky, S Huang, S Spirkl, M Zhong arXiv preprint arXiv:1806.11196, 2018 | 1 | 2018 |

The class of -free graphs: decomposition, algorithms, and -boundedness K Cameron, S Huang, I Penev, V Sivaraman arXiv preprint arXiv:1803.03315, 2018 | 1 | 2018 |

A note on coloring (even-hole, cap)-free graphs S Huang, MVG da Silva arXiv preprint arXiv:1510.09192, 2015 | 1 | 2015 |