Chính T. Hoàng

Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan: Finding and listing induced paths and cycles. Discrete Applied Mathematics 161(4-5): 633-641 (2013)

Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a Sun in Building-Free Graphs. Graphs and Combinatorics 28(3): 347-364 (2012)

Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek: A Characterization of b-Perfect Graphs. Journal of Graph Theory 71(1): 95-122 (2012)

Kathie Cameron, Steven Chaplick, Chính T. Hoàng: Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR abs/1204.5702 (2012)

Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C₄ or a diamond. Discrete Applied Mathematics 159(7): 581-587 (2011)

Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Discrete Mathematics 311(6): 431-434 (2011)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Characterizing directed path graphs by forbidden asteroids. Journal of Graph Theory 68(2): 103-112 (2011)

Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-Colorability of P₅-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010)

Chính T. Hoàng: On the Complexity of Finding a Sun in a Graph. SIAM J. Discrete Math. 23(4): 2156-2162 (2010)

Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek: A characterization of b-perfect graphs. CoRR abs/1004.5306 (2010)

Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray: On minimally b-imperfect graphs. Discrete Applied Mathematics 157(17): 3519-3530 (2009)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs. Electronic Notes in Discrete Mathematics 32: 67-74 (2009)

Daniel Bruce, Chính T. Hoàng, Joe Sawada: A Certifying Algorithm for 3-Colorability of P₅-Free Graphs. ISAAC 2009: 594-604

Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart: On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. CoRR abs/0907.0691 (2009)

Daniel Bruce, Chính T. Hoàng, Joe Sawada: A certifying algorithm for 3-colorability of P5-free graphs. CoRR abs/0907.3497 (2009)

Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009)

Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan: Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009)

Andreas Brandstädt, Chính T. Hoàng: Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008)

Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394

Chính T. Hoàng: On the complexity of finding a sun in a graph. CoRR abs/0807.0462 (2008)

Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs. CoRR abs/0812.2734 (2008)

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan: The Complexity of the List Partition Problem for Graphs. SIAM J. Discrete Math. 21(4): 900-929 (2007)

Andreas Brandstädt, Chính T. Hoàng: On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. Theor. Comput. Sci. 389(1-2): 295-306 (2007)

Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu: Deciding k-colourability of P_5-free graphs in polynomial time. CoRR abs/cs/0702043 (2007)

Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray: A characterization of P₄-comparability graphs. Discrete Mathematics 306(19-20): 2461-2472 (2006)

Kathie Cameron, Chính T. Hoàng: On the structure of certain intersection graphs. Inf. Process. Lett. 99(2): 59-63 (2006)

Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin: A Note on Quasi-triangulated Graphs. SIAM J. Discrete Math. 20(3): 597-602 (2006)

Chính T. Hoàng, Joe Sawada, Xiao Shu: k-Colorability of P5-free graphs. CoRR abs/cs/0609083 (2006)

Chính T. Hoàng, Mekkia Kouider: On the b-dominating coloring of graphs. Discrete Applied Mathematics 152(1-3): 176-186 (2005)

Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan: Disjoint clique cutsets in graphs without long holes. Journal of Graph Theory 48(4): 277-298 (2005)

Andreas Brandstädt, Chính T. Hoàng: On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. IPCO 2005: 265-275

Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev: On simplicial and co-simplicial vertices in graphs. Discrete Applied Mathematics 138(1-2): 117-132 (2004)

Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe: On minimal prime extensions of a four-vertex graph in a prime graph. Discrete Mathematics 288(1-3): 9-17 (2004)

Chính T. Hoàng, Bruce A. Reed: On the Co-P₃-Structure of Perfect Graphs. SIAM J. Discrete Math. 18(3): 571-576 (2004)

Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan: The list partition problem for graphs. SODA 2004: 391-399

Andreas Brandstädt, Chính T. Hoàng, Van Bang Le: Stability number of bull- and chair-free graphs revisited. Discrete Applied Mathematics 131(1): 39-50 (2003)

Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray: Coloring the hypergraph of maximal cliques of a graph with no long path. Discrete Mathematics 272(2-3): 285-290 (2003)

Chính T. Hoàng, Colin J. H. McDiarmid: On the divisibility of graphs. Discrete Mathematics 242(1-3): 145-156 (2002)

Chính T. Hoàng: On the disc-structure of perfect graphs II. The co-C₄-structure. Discrete Mathematics 252(1-3): 141-159 (2002)

Chính T. Hoàng, Van Bang Le: P4-Colorings and P4-Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 109-122 (2001)

Chính T. Hoàng, R. Sritharan: Finding houses and holes in graphs. Theor. Comput. Sci. 259(1-2): 233-244 (2001)

Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy: Planar segment visibility graphs. Comput. Geom. 16(4): 235-243 (2000)

Chính T. Hoàng, Van Bang Le: On P₄-transversals of perfect graphs. Discrete Mathematics 216(1-3): 195-210 (2000)

Chính T. Hoàng, Xiaodan Tu: On the perfect orderability of unions of two graphs. Journal of Graph Theory 33(1): 32-43 (2000)

Chính T. Hoàng, Van Bang Le: Recognizing Perfect 2-Split Graphs. SIAM J. Discrete Math. 13(1): 48-55 (2000)

Chính T. Hoàng: On the Disc-structure of Perfect Graphs I the Co-paw-structure. Discrete Applied Mathematics 94(1-3): 247-262 (1999)

Chính T. Hoàng, Frédéric Maffray, Marc Noy: A characterization of P₄-indifference graphs. Journal of Graph Theory 31(3): 155-162 (1999)

Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy: Planar segment visibility graphs. CCCG 1997

Chính T. Hoàng: A Note on Perfectly orderable Graphs. Discrete Applied Mathematics 65(1-3): 379-386 (1996)

Chính T. Hoàng: on the Complexity of Recognizing a Class of Perfectly orderable Graphs. Discrete Applied Mathematics 66(3): 219-226 (1996)

Chính T. Hoàng: Some properties of minimal imperfect graphs. Discrete Mathematics 160(1-3): 165-175 (1996)

Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray: On the P₄-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory, Ser. B 67(2): 212-237 (1996)

Chính T. Hoàng: Hamiltonian degree conditions for tough graphs. Discrete Mathematics 142(1-3): 121-139 (1995)

Chính T. Hoàng: On the two-edge-colorings of perfect graphs. Journal of Graph Theory 19(2): 271-279 (1995)

Chính T. Hoàng: Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. Discrete Applied Mathematics 55(2): 133-143 (1994)

Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann: A charming class of perfectly orderable graphs. Discrete Mathematics 102(1): 67-74 (1992)

Chính T. Hoàng, Frédéric Maffray: On slim graphs, even pairs, and star-cutsets. Discrete Mathematics 105(1-3): 93-102 (1992)

Chính T. Hoàng: A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. Theor. Comput. Sci. 99(2): 335-344 (1992)

Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann: New properties of perfectly orderable graphs and strongly perfect graphs. Discrete Mathematics 98(3): 161-174 (1991)

Ryan Hayward, Chính T. Hoàng, Frédéric Maffray: Optimizing weakly triangulated graphs. Graphs and Combinatorics 6(1): 33-35 (1990)

Chính T. Hoàng: On the sibling-structure of perfect graphs. J. Comb. Theory, Ser. B 49(2): 282-286 (1990)

Chính T. Hoàng, Nadimpalli V. R. Mahadev: A note on perfect orders. Discrete Mathematics 74(1-2): 77-84 (1989)

Chính T. Hoàng, Bruce A. Reed: P4-comparability graphs. Discrete Mathematics 74(1-2): 173-200 (1989)

Chính T. Hoàng, Frédéric Maffray: Opposition graphs are strict quasi-parity graphs. Graphs and Combinatorics 5(1): 83-85 (1989)

Ryan Hayward, Chính T. Hoàng, Frédéric Maffray: Optimizing weakly triangulated graphs. Graphs and Combinatorics 5(1): 339-349 (1989)

Chính T. Hoàng, Bruce A. Reed: Some classes of perfectly orderable graphs. Journal of Graph Theory 13(4): 445-463 (1989)

Chính T. Hoàng, N. Khouzam: On brittle graphs. Journal of Graph Theory 12(3): 391-404 (1988)

Chính T. Hoàng, Bruce A. Reed: A note on short cycles in diagraphs. Discrete Mathematics 66(1-2): 103-107 (1987)

Chính T. Hoàng: Alternating orientation and alternating colouration of perfect graphs. J. Comb. Theory, Ser. B 42(3): 264-273 (1987)

Chính T. Hoàng: On a conjecture of Meyniel. J. Comb. Theory, Ser. B 42(3): 302-312 (1987)

Vasek Chvátal, Chính T. Hoàng: On the P₄-structure of perfect graphs I. Even decompositions. J. Comb. Theory, Ser. B 39(3): 209-219 (1985)

Chính T. Hoàng: On the P₄-structure of perfect graphs. II. Odd decompositions. J. Comb. Theory, Ser. B 39(3): 220-232 (1985)