Shenwei Huang
Title
Cited by
Cited by
Year
Improved complexity results on k-coloring Pt-free graphs
S Huang
European Journal of Combinatorics 51, 336-346, 2016
452016
Complexity of coloring graphs without paths and cycles
P Hell, S Huang
Discrete Applied Mathematics 216, 211-232, 2017
342017
Improved Complexity Results on k-Coloring P t -Free Graphs
S Huang
International Symposium on Mathematical Foundations of Computer Science, 551-558, 2013
272013
Bounding clique-width via perfect graphs
KK Dabrowski, S Huang, D Paulusma
Journal of Computer and System Sciences 104, 202-215, 2019
24*2019
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
222018
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
S Huang, M Johnson, D Paulusma
The Computer Journal 58 (11), 3074-3088, 2015
212015
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
162016
Bounding the Clique‐Width of H‐Free Chordal Graphs
A Brandstädt, KK Dabrowski, S Huang, D Paulusma
Journal of Graph Theory 86 (1), 42-77, 2017
132017
Bounding the Clique-Width of H-free Chordal Graphs
A Brandstädt, KK Dabrowski, S Huang, D Paulusma
International Symposium on Mathematical Foundations of Computer Science, 139-150, 2015
132015
Colouring square-free graphs without long induced paths
S Gaspers, S Huang, D Paulusma
arXiv preprint arXiv:1805.08270, 2018
102018
Linearly -Bounding (P6,C4)-Free Graphs
S Gaspers, S Huang
International Workshop on Graph-Theoretic Concepts in Computer Science, 263-274, 2017
62017
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
62015
The class of (P 7, C 4, C 5)‐free graphs: Decomposition, algorithms, and χ‐boundedness
K Cameron, S Huang, I Penev, V Sivaraman
Journal of Graph Theory 93 (4), 503-552, 2020
42020
Paired-domination in claw-free graphs
S Huang, L Kang, E Shan
Graphs and Combinatorics 29, 1777-1794, 2013
42013
Critical (P6, banner)-free graphs
S Huang, T Li, Y Shi
Discrete Applied Mathematics 258, 143-151, 2019
32019
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
32011
Vertex-Critical (, banner)-Free Graphs
Q Cai, S Huang, T Li, Y Shi
International Workshop on Frontiers in Algorithmics, 111-120, 2019
22019
-Free Graphs are 4-Colorable
S Gaspers, S Huang
SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019
22019
-Critical Graphs in -Free Graphs
K Cameron, J Goedgebeur, S Huang, Y Shi
arXiv preprint arXiv:2005.03441, 2020
12020
A BOUND FOR THE CHROMATIC NUMBER OF ( , GEM)-FREE GRAPHS
K Cameron, S Huang, O Merkel
Bulletin of the Australian Mathematical Society 100 (2), 182-188, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20