Follow
Chinh T. Hoang
Chinh T. Hoang
Professor of Computer Science, Wilfrid Laurier University
Verified email at wlu.ca
Title
Cited by
Cited by
Year
Integer Programming and Combinatorial Optimization
S Hoşten, B Sturmfels
Springer-Verlag, New York, Berlin, Heidelberg, 2005
226*2005
Deciding k-Colorability of P 5-Free Graphs in Polynomial Time
CT Hoàng, M Kamiński, V Lozin, J Sawada, X Shu
Algorithmica 57, 74-81, 2010
1742010
Optimizing weakly triangulated graphs
R Hayward, C Hoàng, F Maffray
Graphs and Combinatorics 5 (1), 339-349, 1989
1661989
Perfect graphs
CT Hoang
McGill University, 1985
1191985
Four classes of perfectly orderable graphs
V Chvátal, CT Hoàng, NVR Mahadev, D De Werra
Journal of graph theory 11 (4), 481-495, 1987
921987
On the b-dominating coloring of graphs
CT Hoàng, M Kouider
Discrete Applied Mathematics 152 (1-3), 176-186, 2005
912005
Coloring the hypergraph of maximal cliques of a graph with no long path
S Gravier, CT Hoang, F Maffray
Discrete mathematics 272 (2-3), 285-290, 2003
852003
Some classes of perfectly orderable graphs
CT Hoàng, BA Reed
Journal of Graph Theory 13 (4), 445-463, 1989
851989
On clique separators, nearly chordal graphs, and the maximum weight stable set problem
A Brandstädt, CT Hoàng
Theoretical Computer Science 389 (1-2), 295-306, 2007
802007
Efficient algorithms for minimum weighted colouring of some classes of perfect graphs
CT Hoàng
Discrete Applied Mathematics 55 (2), 133-143, 1994
711994
A note on short cycles in diagraphs
CT Hoàng, B Reed
Discrete mathematics 66 (1-2), 103-107, 1987
681987
On the divisibility of graphs
CT Hoàng, C McDiarmid
Discrete Mathematics 242 (1-3), 145-156, 2002
662002
On brittle graphs
CT Hoàng, N Khouzam
Journal of graph theory 12 (3), 391-404, 1988
561988
Eating healthier: Exploring nutrition information for healthier recipe recommendation
M Chen, X Jia, E Gorbonos, CT Hoang, X Yu, Y Liu
Information Processing & Management 57 (6), 102051, 2020
552020
A Certifying Algorithm for 3-Colorability of P 5-Free Graphs
D Bruce, CT Hoàng, J Sawada
Algorithms and Computation: 20th International Symposium, ISAAC 2009 …, 2009
502009
The complexity of the list partition problem for graphs
K Cameron, EM Eschen, CT Hoàng, R Sritharan
SIAM Journal on Discrete Mathematics 21 (4), 900-929, 2008
492008
Some properties of minimal imperfect graphs
CT Hoàng
Discrete Mathematics 160 (1-3), 165-175, 1996
461996
On a conjecture of Meyniel
CT Hoàng
Journal of Combinatorial Theory, Series B 42 (3), 302-312, 1987
431987
Polynomial-time algorithms for minimum weighted colorings of (P5, P¯ 5)-free graphs and similar graph classes
CT Hoàng, DA Lazzarato
Discrete Applied Mathematics 186, 106-111, 2015
362015
Alternating orientation and alternating colouration of perfect graphs
CT Hoàng
Journal of Combinatorial Theory, Series B 42 (3), 264-273, 1987
361987
The system can't perform the operation now. Try again later.
Articles 1–20