Optimizing weakly triangulated graphs R Hayward, C Hoàng, F Maffray Graphs and Combinatorics 5 (1), 339-349, 1989 | 158 | 1989 |

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 (1), 74-81, 2010 | 139 | 2010 |

Perfect graphs CT Hoang, R Sritharan CRC Press, 2015 | 108 | 2015 |

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 | 86 | 1987 |

Some classes of perfectly orderable graphs CT Hoàng, BA Reed Journal of Graph Theory 13 (4), 445-463, 1989 | 81 | 1989 |

On the b-dominating coloring of graphs CT Hoàng, M Kouider Discrete Applied Mathematics 152 (1-3), 176-186, 2005 | 79 | 2005 |

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 | 70 | 2007 |

Efficient algorithms for minimum weighted colouring of some classes of perfect graphs CT Hoàng Discrete Applied Mathematics 55 (2), 133-143, 1994 | 59 | 1994 |

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 | 58 | 2003 |

A note on short cycles in diagraphs CT Hoàng, B Reed Discrete mathematics 66 (1-2), 103-107, 1987 | 56 | 1987 |

On brittle graphs CT Hoàng, N Khouzam Journal of graph theory 12 (3), 391-404, 1988 | 54 | 1988 |

On the divisibility of graphs CT Hoàng, C McDiarmid Discrete mathematics 242 (1-3), 145-156, 2002 | 53 | 2002 |

Maximum planar sets that determine k distances P Erdős, P Fishburn Discrete Mathematics 160 (1-3), 115-125, 1996 | 49 | 1996 |

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 | 48 | 2008 |

Some properties of minimal imperfect graphs CT Hoàng Discrete Mathematics 160 (1-3), 165-175, 1996 | 45 | 1996 |

A Certifying Algorithm for 3-Colorability of *P*_{5}-Free GraphsD Bruce, CT Hoàng, J Sawada International Symposium on Algorithms and Computation, 594-604, 2009 | 40 | 2009 |

On a conjecture of Meyniel CT Hoàng Journal of Combinatorial Theory, Series B 42 (3), 302-312, 1987 | 40 | 1987 |

Integer Programming and Combinatorial Optimization S Hoşten, B Sturmfels Springer-Verlag, New York, Berlin, Heidelberg, 2005 | 38* | 2005 |

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 | 36 | 2015 |

The list partition problem for graphs K Cameron, EM Eschen, CT Hoàng, R Sritharan Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete …, 2004 | 33 | 2004 |