Chính T. Hoàng

114 papers A* 1B 3C 1Journal 108Unranked 1
YearRankTypeTitle / Venue / Authors
2026 J jnl
On graphs without four-vertex induced subgraphs.
Discret. Appl. Math.
Kathie Cameron, Chính T. Hoàng, Taite Lagrange
2026 J jnl
On the structure of perfectly divisible graphs.
Discret. Math.
Chính T. Hoàng
2025 J jnl
On the structure of (4K
CoRR
Chính T. Hoàng, Ramin Javadi, Nicolas Trotignon
2025 J jnl
On the structure of (dart, odd hole)-free graphs.
CoRR
Chính T. Hoàng
2024 J jnl
A Closure Lemma for tough graphs and Hamiltonian degree conditions.
Discret. Math.
Chính T. Hoàng, Cléophée Robin
2024 J jnl
A class of graphs with large rankwidth.
Discret. Math.
Chính T. Hoàng, Nicolas Trotignon
2024 J jnl
Infinite Families of k-Vertex-Critical (P
Graphs Comb.
Ben Cameron, Chính T. Hoàng
2024 J jnl
Vertex-critical (P3+ℓP1)-free and vertex-critical (gem, co-gem)-free graphs.
Discret. Appl. Math.
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
2023 J jnl
A refinement on the structure of vertex-critical (
Theor. Comput. Sci.
Ben Cameron, Chính T. Hoàng
2023 J jnl
Infinite families of k-vertex-critical (P
CoRR
Ben Cameron, Chính T. Hoàng
2022 J jnl
A refinement on the structure of vertex-critical (P
CoRR
Ben Cameron, Chính T. Hoàng
2022 J jnl
Dichotomizing k-vertex-critical H-free graphs for H of order four.
Discret. Appl. Math.
Ben Cameron, Chính T. Hoàng, Joe Sawada
2022 J jnl
On coloring a class of claw-free and hole-twin-free graphs.
Discret. Appl. Math.
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
2022 J jnl
On the Structure of Graphs Without Claw, 4K
Graphs Comb.
Tala Abuadas, Chính T. Hoàng
2022 J jnl
Vertex coloring (4
Theor. Comput. Sci.
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
2022 J jnl
Vertex-critical (P
CoRR
Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada
2020 J jnl
A class of graphs of large rankwidth.
CoRR
Chính T. Hoàng, Nicolas Trotignon
2020 J jnl
Dichotomizing k-vertex-critical H-free graphs for H of order four.
CoRR
Ben Cameron, Chính T. Hoàng, Joe Sawada
2020 J jnl
The Intersection of Two Vertex Coloring Problems.
Graphs Comb.
Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
2019 J jnl
Chromatic symmetric functions and H-free graphs.
Graphs Comb.
Angèle M. Hamel, Chính T. Hoàng, Jake E. Tuero
2019 J jnl
Classes of Graphs with e-Positive Chromatic Symmetric Function.
Electron. J. Comb.
Angèle M. Foley, Chính T. Hoàng, Owen D. Merkel
2019 C conf
On Coloring a Class of Claw-free Graphs: To the memory of Frédéric Maffray.
LAGOS
Yingjun Dai, Angèle M. Foley, Chính T. Hoàng
2019 J jnl
Solving the clique cover problem on (bull, C4)-free graphs.
Discret. Appl. Math.
Kathie Cameron, Chính T. Hoàng
2019 J jnl
The intersection of two vertex coloring problems.
CoRR
Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
2018 J jnl
A coloring algorithm for -free line graphs.
Discret. Appl. Math.
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray
2018 J jnl
On the Structure of (Even Hole, Kite)-Free Graphs.
Graphs Comb.
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng
2018 J jnl
On the structure of (banner, odd hole)-free graphs.
J. Graph Theory
Chính T. Hoàng
2018 J jnl
On the structure of (pan, even hole)-free graphs.
J. Graph Theory
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
2017 J jnl
Characterizations of (4K1, C4, C5)-free graphs.
Discret. Appl. Math.
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng, Kevin Holmes, Tom P. LaMantia
2017 J jnl
On color-critical (P
Discret. Appl. Math.
Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait
2017 J jnl
Solving the clique cover problem on (bull, C
CoRR
Kathie Cameron, Chính T. Hoàng
2016 J jnl
Edge intersection graphs of L-shaped paths in grids.
Discret. Appl. Math.
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
2015 J jnl
A Coloring Algorithm for $4K_1$-free line graphs.
CoRR
Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng
2015 J jnl
Constructions of k-critical P5-free graphs.
Discret. Appl. Math.
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle
2015 J jnl
On the structure of (banner, odd hole)-free graphs.
CoRR
Chính T. Hoàng
2015 J jnl
On the structure of (pan, even hole)-free graphs.
CoRR
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
2015 J jnl
Polynomial-time algorithms for minimum weighted colorings of ()-free graphs and similar graph classes.
Discret. Appl. Math.
Chính T. Hoàng, D. Adam Lazzarato
2014 J jnl
Polynomial-time algorithms for minimum weighted colorings of ($P_5, \bar{P}_5$)-free graphs and related graph classes.
CoRR
Chính T. Hoàng, D. Adam Lazzarato
2013 J jnl
Edge Intersection Graphs of L-Shaped Paths in Grids.
Electron. Notes Discret. Math.
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
2013 J jnl
Finding and listing induced paths and cycles.
Discret. Appl. Math.
Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan
2013 J jnl
On k-critical P
Electron. Notes Discret. Math.
Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada
2012 J jnl
A Characterization of b-Perfect Graphs.
J. Graph Theory
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
2012 J jnl
Edge Intersection Graphs of L-Shaped Paths in Grids
CoRR
Kathie Cameron, Steven Chaplick, Chính T. Hoàng
2012 J jnl
Finding a Sun in Building-Free Graphs.
Graphs Comb.
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2011 J jnl
Characterizing directed path graphs by forbidden asteroids.
J. Graph Theory
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2011 J jnl
On graphs without a C
Discret. Appl. Math.
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2011 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.
Discret. Math.
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2010 J jnl
A characterization of b-perfect graphs
CoRR
Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek
2010 J jnl
Deciding
Algorithmica
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2010 J jnl
On the Complexity of Finding a Sun in a Graph.
SIAM J. Discret. Math.
Chính T. Hoàng
2009 B conf
A Certifying Algorithm for 3-Colorability of
ISAAC
Daniel Bruce, Chính T. Hoàng, Joe Sawada
2009 J jnl
A certifying algorithm for 3-colorability of P5-free graphs
CoRR
Daniel Bruce, Chính T. Hoàng, Joe Sawada
2009 J jnl
Asteroids in rooted and directed path graphs.
Electron. Notes Discret. Math.
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2009 J jnl
Finding a sun in building-free graphs
CoRR
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2009 J jnl
On graphs without a C4 or a diamond
CoRR
Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan
2009 J jnl
On minimally b-imperfect graphs.
Discret. Appl. Math.
Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray
2009 J jnl
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two
CoRR
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart
2008 B conf
A Note on k-Colorability of P5-Free Graphs.
MFCS
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2008 J jnl
Asteroids in rooted and directed path graphs
CoRR
Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque
2008 J jnl
Maximum Induced Matchings for Chordal Graphs in Linear Time.
Algorithmica
Andreas Brandstädt, Chính T. Hoàng
2008 J jnl
On the complexity of finding a sun in a graph
CoRR
Chính T. Hoàng
2007 J jnl
An O(
Graphs Comb.
Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2007 J jnl
Deciding k-colourability of P_5-free graphs in polynomial time
CoRR
Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
2007 J jnl
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem.
Theor. Comput. Sci.
Andreas Brandstädt, Chính T. Hoàng
2007 J jnl
The Complexity of the List Partition Problem for Graphs.
SIAM J. Discret. Math.
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2006 J jnl
A Note on Quasi-triangulated Graphs.
SIAM J. Discret. Math.
Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin
2006 J jnl
A characterization of P
Discret. Math.
Celina M. H. de Figueiredo, Chính T. Hoàng, Frédéric Maffray
2006 J jnl
On the structure of certain intersection graphs.
Inf. Process. Lett.
Kathie Cameron, Chính T. Hoàng
2006 J jnl
k-Colorability of P5-free graphs
CoRR
Chính T. Hoàng, Joe Sawada, Xiao Shu
2005 J jnl
Disjoint clique cutsets in graphs without long holes.
J. Graph Theory
Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
2005 B conf
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.
IPCO
Andreas Brandstädt, Chính T. Hoàng
2005 J jnl
On the
Discret. Appl. Math.
Chính T. Hoàng, Mekkia Kouider
2004 J jnl
On minimal prime extensions of a four-vertex graph in a prime graph.
Discret. Math.
Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe
2004 J jnl
On simplicial and co-simplicial vertices in graphs.
Discret. Appl. Math.
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
2004 J jnl
On the Co-P
SIAM J. Discret. Math.
Chính T. Hoàng, Bruce A. Reed
2004 A* conf
The list partition problem for graphs.
SODA
Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
2003 J jnl
Coloring the hypergraph of maximal cliques of a graph with no long path.
Discret. Math.
Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
2003 J jnl
Stability number of bull- and chair-free graphs revisited.
Discret. Appl. Math.
Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
2002 J jnl
On the disc-structure of perfect graphs II. The co-
Discret. Math.
Chính T. Hoàng
2002 J jnl
On the divisibility of graphs.
Discret. Math.
Chính T. Hoàng, Colin J. H. McDiarmid
2001 J jnl
Finding houses and holes in graphs.
Theor. Comput. Sci.
Chính T. Hoàng, R. Sritharan
2001 J jnl
P4-Colorings and P4-Bipartite Graphs.
Discret. Math. Theor. Comput. Sci.
Chính T. Hoàng, Van Bang Le
2000 J jnl
On
Discret. Math.
Chính T. Hoàng, Van Bang Le
2000 J jnl
On the perfect orderability of unions of two graphs.
J. Graph Theory
Chính T. Hoàng, Xiaodan Tu
2000 J jnl
Planar segment visibility graphs.
Comput. Geom.
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
2000 J jnl
Recognizing Perfect 2-Split Graphs.
SIAM J. Discret. Math.
Chính T. Hoàng, Van Bang Le
1999 J jnl
A characterization of
J. Graph Theory
Chính T. Hoàng, Frédéric Maffray, Marc Noy
1999 J jnl
On the Disc-structure of Perfect Graphs I the Co-paw-structure.
Discret. Appl. Math.
Chính T. Hoàng
1997 — conf
Planar segment visibility graphs.
CCCG
Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
1996 J jnl
A Note on Perfectly orderable Graphs.
Discret. Appl. Math.
Chính T. Hoàng
1996 J jnl
On the
J. Comb. Theory B
Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
1996 J jnl
Some properties of minimal imperfect graphs.
Discret. Math.
Chính T. Hoàng
1996 J jnl
on the Complexity of Recognizing a Class of Perfectly orderable Graphs.
Discret. Appl. Math.
Chính T. Hoàng
1995 J jnl
Hamiltonian degree conditions for tough graphs.
Discret. Math.
Chính T. Hoàng
1995 J jnl
On the two-edge-colorings of perfect graphs.
J. Graph Theory
Chính T. Hoàng
1994 J jnl
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs.
Discret. Appl. Math.
Chính T. Hoàng
1992 J jnl
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs.
Theor. Comput. Sci.
Chính T. Hoàng
1992 J jnl
A charming class of perfectly orderable graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
1992 J jnl
On slim graphs, even pairs, and star-cutsets.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray
1991 J jnl
New properties of perfectly orderable graphs and strongly perfect graphs.
Discret. Math.
Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
1990 J jnl
On the sibling-structure of perfect graphs.
J. Comb. Theory B
Chính T. Hoàng
1990 J jnl
Optimizing weakly triangulated graphs.
Graphs Comb.
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
1989 J jnl
A note on perfect orders.
Discret. Math.
Chính T. Hoàng, Nadimpalli V. R. Mahadev
1989 J jnl
Opposition graphs are strict quasi-parity graphs.
Graphs Comb.
Chính T. Hoàng, Frédéric Maffray
1989 J jnl
Optimizing weakly triangulated graphs.
Graphs Comb.
Ryan Hayward, Chính T. Hoàng, Frédéric Maffray
1989 J jnl
P4-comparability graphs.
Discret. Math.
Chính T. Hoàng, Bruce A. Reed
1989 J jnl
Some classes of perfectly orderable graphs.
J. Graph Theory
Chính T. Hoàng, Bruce A. Reed
1988 J jnl
On brittle graphs.
J. Graph Theory
Chính T. Hoàng, N. Khouzam
1987 J jnl
A note on short cycles in diagraphs.
Discret. Math.
Chính T. Hoàng, Bruce A. Reed
1987 J jnl
Alternating orientation and alternating colouration of perfect graphs.
J. Comb. Theory B
Chính T. Hoàng
1987 J jnl
Four classes of perfectly orderable graphs.
J. Graph Theory
Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra
1987 J jnl
On a conjecture of Meyniel.
J. Comb. Theory B
Chính T. Hoàng
1985 J jnl
On the
J. Comb. Theory B
Vasek Chvátal, Chính T. Hoàng
1985 J jnl
On the
J. Comb. Theory B
Chính T. Hoàng