( en | de | ru )

 

Disambiguation of "Huang, Shenwei"

Author of the publication

copydeleteadd this publication to your clipboard
Improved Complexity Results on k-Coloring P t -Free Graphs.

. MFCS, volume 8087 of Lecture Notes in Computer Science, page 551-558. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Feiqing Huang

Zhida Huang

Ying Huang

Haishi Huang

Haowei Huang

 

Other publications of authors with the same name

Improved Complexity Results on k-Coloring P t -Free Graphs.. MFCS, volume 8087 of Lecture Notes in Computer Science, page 551-558. Springer, (2013)Critical (P5,dart)-Free Graphs., , , and . COCOA (2), volume 14462 of Lecture Notes in Computer Science, page 390-402. Springer, (2023)List 3-Coloring Graphs with No Induced P6+rP3., , , and . Algorithmica, 83 (1): 216-251 (2021)LR-GNN: a graph neural network based on link representation for predicting molecular associations., , , , and . Briefings Bioinform., (2022)Perfect matchings in paired domination vertex critical graphs., , and . J. Comb. Optim., 23 (4): 507-518 (2012)Complexity of Coloring Graphs without Paths and Cycles., and . LATIN, volume 8392 of Lecture Notes in Computer Science, page 538-549. Springer, (2014)Linearly $χ$-Bounding $(P_6, C_4)$-Free Graphs., and . CoRR, (2017)Colouring Square-Free Graphs without Long Induced Paths., , and . STACS, volume 96 of LIPIcs, page 35:1-35:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Narrowing the Complexity Gap for Colouring (C s , P t )-Free Graphs., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 162-173. Springer, (2014)Complexity of Ck-Coloring in Hereditary Classes of Graphs., , , , and . ESA, volume 144 of LIPIcs, page 31:1-31:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)