Shenwei Huang
Shenwei Huang
Verifisert e-postadresse på unsw.edu.au - Startside
Tittel
Sitert av
Sitert av
År
Improved complexity results on k-coloring Pt-free graphs
S Huang
European Journal of Combinatorics 51, 336-346, 2016
642016
Complexity of coloring graphs without paths and cycles
P Hell, S Huang
Discrete Applied Mathematics 216, 211-232, 2017
402017
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
342018
Narrowing the Complexity Gap for Colouring (Cs, Pt)-Free Graphs
S Huang, M Johnson, D Paulusma
The Computer Journal 58 (11), 3074-3088, 2015
272015
Improved Complexity Results on k-Coloring P t -Free Graphs
S Huang
International Symposium on Mathematical Foundations of Computer Science, 551-558, 2013
262013
Bounding clique-width via perfect graphs
KK Dabrowski, S Huang, D Paulusma
Journal of Computer and System Sciences 104, 202-215, 2019
24*2019
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
182016
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
152017
Colouring square-free graphs without long induced paths
S Gaspers, S Huang, D Paulusma
Journal of Computer and System Sciences 106, 60-79, 2019
132019
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
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
102020
Linearly -Bounding (P6,C4)-Free Graphs
S Gaspers, S Huang
International Workshop on Graph-Theoretic Concepts in Computer Science, 263-274, 2017
72017
List-three-coloring graphs with no induced
M Chudnovsky, S Huang, S Spirkl, M Zhong
arXiv preprint arXiv:1806.11196, 2018
62018
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
Paired-domination in claw-free graphs
S Huang, L Kang, E Shan
Graphs and Combinatorics 29, 1777-1794, 2013
62013
-Free Graphs are 4-Colorable
S Gaspers, S Huang
SIAM Journal on Discrete Mathematics 33 (2), 1095-1120, 2019
52019
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
52011
List 3-Coloring Graphs with No Induced P 6 + r P 3
M Chudnovsky, S Huang, S Spirkl, M Zhong
Algorithmica 83 (1), 216-251, 2021
42021
Complexity of -coloring in hereditary classes of graphs
M Chudnovsky, S Huang, P Rzążewski, S Spirkl, M Zhong
arXiv preprint arXiv:2005.01824, 2020
42020
Critical (P6, banner)-free graphs
S Huang, T Li, Y Shi
Discrete Applied Mathematics 258, 143-151, 2019
42019
Systemet kan ikke utføre handlingen. Prøv igjen senere.
Artikler 1–20