Chính T. Hoàng

ORCID

Publication Activity (10 Years)

Years Active: 1985-2024
Publications (10 Years): 27

Top Venues

Publications

Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs. Discret. Appl. Math. 344 (2024)
Chính T. Hoàng, Nicolas Trotignon
A class of graphs with large rankwidth. Discret. Math. 347 (1) (2024)
Chính T. Hoàng, Cléophée Robin
A Closure Lemma for tough graphs and Hamiltonian degree conditions. Discret. Math. 347 (4) (2024)
Ben Cameron, Chính T. Hoàng
)-Free Graphs. Graphs Comb. 40 (2) (2024)
Ben Cameron, Chính T. Hoàng
, gem)-free graphs. Theor. Comput. Sci. 961 (2023)
Ben Cameron, Chính T. Hoàng
)-free graphs. CoRR (2023)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312 (2022)
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
, hole-twin, 5-wheel)-free graphs. Theor. Comput. Sci. 914 (2022)
Ben Cameron, Chính T. Hoàng
, gem)-free graphs. CoRR (2022)
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
)-free and vertex-critical (gem, co-gem)-free graphs. CoRR (2022)
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
On coloring a class of claw-free and hole-twin-free graphs. Discret. Appl. Math. 323 (2022)
Tala Abuadas, Chính T. Hoàng
and co-R. Graphs Comb. 38 (4) (2022)
Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
The Intersection of Two Vertex Coloring Problems. Graphs Comb. 36 (1) (2020)
Ben Cameron, Chính T. Hoàng, Joe Sawada
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR (2020)
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray. LAGOS (2019)
Angèle M. Foley, Chính T. Hoàng, Owen D. Merkel
Classes of Graphs with e-Positive Chromatic Symmetric Function. Electron. J. Comb. 26 (3) (2019)
Angèle M. Hamel, Chính T. Hoàng, Jake E. Tuero
Chromatic symmetric functions and H-free graphs. Graphs Comb. 35 (4) (2019)
Kathie Cameron, Chính T. Hoàng
Solving the clique cover problem on (bull, C4)-free graphs. Discret. Appl. Math. 261 (2019)
Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
The intersection of two vertex coloring problems. CoRR (2019)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87 (1) (2018)
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng
On the Structure of (Even Hole, Kite)-Free Graphs. Graphs Comb. 34 (5) (2018)
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray
A coloring algorithm for -free line graphs. Discret. Appl. Math. 234 (2018)
Chính T. Hoàng
On the structure of (banner, odd hole)-free graphs. J. Graph Theory 89 (4) (2018)
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
Characterizations of (4K1, C4, C5)-free graphs. Discret. Appl. Math. 231 (2017)
Kathie Cameron, Chính T. Hoàng
)-free graphs. CoRR (2017)
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
)-free graphs. Discret. Appl. Math. 216 (2017)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge intersection graphs of L-shaped paths in grids. Discret. Appl. Math. 210 (2016)
Chính T. Hoàng
On the structure of (banner, odd hole)-free graphs. CoRR (2015)
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng
A Coloring Algorithm for $4K_1$-free line graphs. CoRR (2015)
Chính T. Hoàng, D. Adam Lazzarato
Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes. Discret. Appl. Math. 186 (2015)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
On the structure of (pan, even hole)-free graphs. CoRR (2015)
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182 (2015)
Chính T. Hoàng, D. Adam Lazzarato
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes. CoRR (2014)
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
Finding and listing induced paths and cycles. Discret. Appl. Math. 161 (4-5) (2013)
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada
-free graphs. Electron. Notes Discret. Math. 44 (2013)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge Intersection Graphs of L-Shaped Paths in Grids. Electron. Notes Discret. Math. 44 (2013)
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
Edge Intersection Graphs of L-Shaped Paths in Grids CoRR (2012)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a Sun in Building-Free Graphs. Graphs Comb. 28 (3) (2012)
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
A Characterization of b-Perfect Graphs. J. Graph Theory 71 (1) (2012)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68 (2) (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. Discret. Math. 311 (6) (2011)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
or a diamond. Discret. Appl. Math. 159 (7) (2011)
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
-Free Graphs in Polynomial Time. Algorithmica 57 (1) (2010)
Chính T. Hoàng
On the Complexity of Finding a Sun in a Graph. SIAM J. Discret. Math. 23 (4) (2010)
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
A characterization of b-perfect graphs CoRR (2010)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. 32 (2009)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
On graphs without a C4 or a diamond CoRR (2009)
Daniel Bruce, Chính T. Hoàng, Joe Sawada
A certifying algorithm for 3-colorability of P5-free graphs CoRR (2009)
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
Finding a sun in building-free graphs CoRR (2009)
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 (2009)
Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray
On minimally b-imperfect graphs. Discret. Appl. Math. 157 (17) (2009)
Daniel Bruce, Chính T. Hoàng, Joe Sawada
-Free Graphs. ISAAC (2009)
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)
Chính T. Hoàng
On the complexity of finding a sun in a graph CoRR (2008)
Andreas Brandstädt, Chính T. Hoàng
Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52 (4) (2008)
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
Asteroids in rooted and directed path graphs CoRR (2008)
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23 (Supplement-1) (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 (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) (2007)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The Complexity of the List Partition Problem for Graphs. SIAM J. Discret. Math. 21 (4) (2007)
Kathie Cameron, Chính T. Hoàng
On the structure of certain intersection graphs. Inf. Process. Lett. 99 (2) (2006)
Chính T. Hoàng, Joe Sawada, Xiao Shu
k-Colorability of P5-free graphs CoRR (2006)
Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin
A Note on Quasi-triangulated Graphs. SIAM J. Discret. Math. 20 (3) (2006)
Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray
-comparability graphs. Discret. Math. 306 (19-20) (2006)
Andreas Brandstädt, Chính T. Hoàng
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. IPCO (2005)
Chính T. Hoàng, Mekkia Kouider
-dominating coloring of graphs. Discret. Appl. Math. 152 (1-3) (2005)
Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
Disjoint clique cutsets in graphs without long holes. J. Graph Theory 48 (4) (2005)
Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe
On minimal prime extensions of a four-vertex graph in a prime graph. Discret. Math. 288 (1-3) (2004)
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
On simplicial and co-simplicial vertices in graphs. Discret. Appl. Math. 138 (1-2) (2004)
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
The list partition problem for graphs. SODA (2004)
Chính T. Hoàng, Bruce A. Reed
-Structure of Perfect Graphs. SIAM J. Discret. Math. 18 (3) (2004)
Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
Stability number of bull- and chair-free graphs revisited. Discret. Appl. Math. 131 (1) (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. Discret. Math. 272 (2-3) (2003)
Chính T. Hoàng, Colin J. H. McDiarmid
On the divisibility of graphs. Discret. Math. 242 (1-3) (2002)
Chính T. Hoàng
-structure. Discret. Math. 252 (1-3) (2002)
Chính T. Hoàng, Van Bang Le
P4-Colorings and P4-Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 4 (2) (2001)
Chính T. Hoàng, R. Sritharan
Finding houses and holes in graphs. Theor. Comput. Sci. 259 (1-2) (2001)
Chính T. Hoàng, Van Bang Le
Recognizing Perfect 2-Split Graphs. SIAM J. Discret. Math. 13 (1) (2000)
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
Planar segment visibility graphs. Comput. Geom. 16 (4) (2000)
Chính T. Hoàng, Xiaodan Tu
On the perfect orderability of unions of two graphs. J. Graph Theory 33 (1) (2000)
Chính T. Hoàng, Van Bang Le
-transversals of perfect graphs. Discret. Math. 216 (1-3) (2000)
Chính T. Hoàng
On the Disc-structure of Perfect Graphs I the Co-paw-structure. Discret. Appl. Math. 94 (1-3) (1999)
Chính T. Hoàng, Frédéric Maffray, Marc Noy
-indifference graphs. J. Graph Theory 31 (3) (1999)
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
Planar segment visibility graphs. CCCG (1997)
Chính T. Hoàng
Some properties of minimal imperfect graphs. Discret. Math. 160 (1-3) (1996)
Chính T. Hoàng
on the Complexity of Recognizing a Class of Perfectly orderable Graphs. Discret. Appl. Math. 66 (3) (1996)
Chính T. Hoàng
A Note on Perfectly orderable Graphs. Discret. Appl. Math. 65 (1-3) (1996)
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory, Ser. B 67 (2) (1996)
Chính T. Hoàng
On the two-edge-colorings of perfect graphs. J. Graph Theory 19 (2) (1995)
Chính T. Hoàng
Hamiltonian degree conditions for tough graphs. Discret. Math. 142 (1-3) (1995)
Chính T. Hoàng
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. Discret. Appl. Math. 55 (2) (1994)
Chính T. Hoàng
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. Theor. Comput. Sci. 99 (2) (1992)
Chính T. Hoàng, Frédéric Maffray
On slim graphs, even pairs, and star-cutsets. Discret. Math. 105 (1-3) (1992)
Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
A charming class of perfectly orderable graphs. Discret. Math. 102 (1) (1992)
Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
New properties of perfectly orderable graphs and strongly perfect graphs. Discret. Math. 98 (3) (1991)
Chính T. Hoàng
On the sibling-structure of perfect graphs. J. Comb. Theory, Ser. B 49 (2) (1990)
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
Optimizing weakly triangulated graphs. Graphs Comb. 6 (1) (1990)
Chính T. Hoàng, Nadimpalli V. R. Mahadev
A note on perfect orders. Discret. Math. 74 (1-2) (1989)
Chính T. Hoàng, Bruce A. Reed
Some classes of perfectly orderable graphs. J. Graph Theory 13 (4) (1989)
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
Optimizing weakly triangulated graphs. Graphs Comb. 5 (1) (1989)

Chính T. Hoàng.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Chính T. Hoàng