default search action
Chính T. Hoàng
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j83]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: 179-187 (2024) - [j82]Chính T. Hoàng
A class of graphs with large rankwidth. Discret. Math. 347(1): 113699 (2024) - [j81]Chính T. Hoàng
A Closure Lemma for tough graphs and Hamiltonian degree conditions. Discret. Math. 347(4): 113872 (2024) - [j80]Ben Cameron
Infinite Families of k-Vertex-Critical (P5, C5)-Free Graphs. Graphs Comb. 40(2): 30 (2024) - 2023
- [j79]Ben Cameron
A refinement on the structure of vertex-critical (P5, gem)-free graphs. Theor. Comput. Sci. 961: 113936 (2023) - [i21]Ben Cameron, Chính T. Hoàng:
Infinite families of k-vertex-critical (P5, C5)-free graphs. CoRR abs/2306.03376 (2023) - 2022
- [j78]Ben Cameron
Dichotomizing k-vertex-critical H-free graphs for H of order four. Discret. Appl. Math. 312: 106-115 (2022) - [j77]Yingjun Dai
On coloring a class of claw-free and hole-twin-free graphs. Discret. Appl. Math. 323: 162-170 (2022) - [j76]Tala Abuadas, Chính T. Hoàng
On the Structure of Graphs Without Claw, 4K1 and co-R. Graphs Comb. 38(4): 123 (2022) - [j75]Yingjun Dai
Vertex coloring (4K1, hole-twin, 5-wheel)-free graphs. Theor. Comput. Sci. 914: 14-22 (2022) - [i20]Tala Abuadas, Ben Cameron, Chính T. Hoàng, Joe Sawada:
Vertex-critical (P3+𝓁P1)-free and vertex-critical (gem, co-gem)-free graphs. CoRR abs/2206.03422 (2022) - [i19]Ben Cameron, Chính T. Hoàng:
A refinement on the structure of vertex-critical (P5, gem)-free graphs. CoRR abs/2212.04659 (2022) - 2020
- [j74]Angèle M. Foley, Dallas J. Fraser, Chính T. Hoàng
The Intersection of Two Vertex Coloring Problems. Graphs Comb. 36(1): 125-138 (2020) - [i18]Ben Cameron, Chính T. Hoàng, Joe Sawada:
Dichotomizing k-vertex-critical H-free graphs for H of order four. CoRR abs/2007.00057 (2020) - [i17]Chính T. Hoàng, Nicolas Trotignon:
A class of graphs of large rankwidth. CoRR abs/2007.11513 (2020)
2010 – 2019
- 2019
- [j73]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): 3 (2019) - [j72]Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. Discret. Appl. Math. 261: 119-122 (2019) - [j71]Angèle M. Hamel
Chromatic symmetric functions and H-free graphs. Graphs Comb. 35(4): 815-825 (2019) - [c6]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: 369-377 - [i16]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 abs/1904.08180 (2019) - 2018
- [j70]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: 76-85 (2018) - [j69]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): 989-999 (2018) - [j68]Kathie Cameron, Steven Chaplick
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1): 108-129 (2018) - [j67]Chính T. Hoàng
On the structure of (banner, odd hole)-free graphs. J. Graph Theory 89(4): 395-412 (2018) - 2017
- [j66]Harjinder S. Dhaliwal, Angèle M. Hamel, Chính T. Hoàng, Frédéric Maffray, Tyler J. D. McConnell, Stefan A. Panait:
On color-critical (P5, co-P5)-free graphs. Discret. Appl. Math. 216: 142-148 (2017) - [j65]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: 166-174 (2017) - [i15]Kathie Cameron, Chính T. Hoàng:
Solving the clique cover problem on (bull, C4)-free graphs. CoRR abs/1704.00316 (2017) - 2016
- [j64]Kathie Cameron, Steven Chaplick
Edge intersection graphs of L-shaped paths in grids. Discret. Appl. Math. 210: 185-194 (2016) - 2015
- [j63]Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada, Martin Vatshelle:
Constructions of k-critical P5-free graphs. Discret. Appl. Math. 182: 91-98 (2015) - [j62]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: 106-111 (2015) - [i14]Dallas J. Fraser, Angèle M. Hamel, Chính T. Hoàng:
A Coloring Algorithm for $4K_1$-free line graphs. CoRR abs/1506.05719 (2015) - [i13]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. CoRR abs/1508.03062 (2015) - [i12]Chính T. Hoàng:
On the structure of (banner, odd hole)-free graphs. CoRR abs/1510.02324 (2015) - 2014
- [i11]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 abs/1409.0893 (2014) - 2013
- [j61]Chính T. Hoàng, Marcin Kaminski, Joe Sawada, R. Sritharan:
Finding and listing induced paths and cycles. Discret. Appl. Math. 161(4-5): 633-641 (2013) - [j60]Chính T. Hoàng, Brian Moore, Daniel Recoskie, Joe Sawada:
On k-critical P5-free graphs. Electron. Notes Discret. Math. 44: 187-193 (2013) - [j59]Kathie Cameron, Steven Chaplick
Edge Intersection Graphs of L-Shaped Paths in Grids. Electron. Notes Discret. Math. 44: 363-369 (2013) - 2012
- [j58]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a Sun in Building-Free Graphs. Graphs Comb. 28(3): 347-364 (2012) - [j57]Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A Characterization of b-Perfect Graphs. J. Graph Theory 71(1): 95-122 (2012) - [i10]Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
Edge Intersection Graphs of L-Shaped Paths in Grids. CoRR abs/1204.5702 (2012) - 2011
- [j56]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. Discret. Appl. Math. 159(7): 581-587 (2011) - [j55]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): 431-434 (2011) - [j54]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Characterizing directed path graphs by forbidden asteroids. J. Graph Theory 68(2): 103-112 (2011) - 2010
- [j53]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin
Deciding k-Colorability of P5-Free Graphs in Polynomial Time. Algorithmica 57(1): 74-81 (2010) - [j52]Chính T. Hoàng:
On the Complexity of Finding a Sun in a Graph. SIAM J. Discret. Math. 23(4): 2156-2162 (2010) - [i9]Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A characterization of b-perfect graphs. CoRR abs/1004.5306 (2010)
2000 – 2009
- 2009
- [j51]Chính T. Hoàng, Cláudia Linhares Sales
On minimally b-imperfect graphs. Discret. Appl. Math. 157(17): 3519-3530 (2009) - [j50]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. Electron. Notes Discret. Math. 32: 67-74 (2009) - [c5]Daniel Bruce, Chính T. Hoàng, Joe Sawada:
A Certifying Algorithm for 3-Colorability of P5-Free Graphs. ISAAC 2009: 594-604 - [i8]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) - [i7]Daniel Bruce, Chính T. Hoàng, Joe Sawada:
A certifying algorithm for 3-colorability of P5-free graphs. CoRR abs/0907.3497 (2009) - [i6]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
On graphs without a C4 or a diamond. CoRR abs/0909.4719 (2009) - [i5]Elaine M. Eschen, Chính T. Hoàng, Jeremy P. Spinrad, R. Sritharan:
Finding a sun in building-free graphs. CoRR abs/0910.1808 (2009) - 2008
- [j49]Andreas Brandstädt, Chính T. Hoàng:
Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008) - [c4]Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin
A Note on k-Colorability of P5-Free Graphs. MFCS 2008: 387-394 - [i4]Chính T. Hoàng:
On the complexity of finding a sun in a graph. CoRR abs/0807.0462 (2008) - [i3]Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque:
Asteroids in rooted and directed path graphs. CoRR abs/0812.2734 (2008) - 2007
- [j48]Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
An O(n 3)-Time Recognition Algorithm for hhds-free Graphs. Graphs Comb. 23(Supplement-1): 209-231 (2007) - [j47]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): 900-929 (2007) - [j46]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) - [i2]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) - 2006
- [j45]Celina M. H. de Figueiredo
A characterization of P4-comparability graphs. Discret. Math. 306(19-20): 2461-2472 (2006) - [j44]Kathie Cameron, Chính T. Hoàng:
On the structure of certain intersection graphs. Inf. Process. Lett. 99(2): 59-63 (2006) - [j43]Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin:
A Note on Quasi-triangulated Graphs. SIAM J. Discret. Math. 20(3): 597-602 (2006) - [i1]Chính T. Hoàng, Joe Sawada, Xiao Shu:
k-Colorability of P5-free graphs. CoRR abs/cs/0609083 (2006) - 2005
- [j42]Chính T. Hoàng, Mekkia Kouider:
On the b-dominating coloring of graphs. Discret. Appl. Math. 152(1-3): 176-186 (2005) - [j41]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): 277-298 (2005) - [c3]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 - 2004
- [j40]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): 117-132 (2004) - [j39]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): 9-17 (2004) - [j38]Chính T. Hoàng, Bruce A. Reed:
On the Co-P3-Structure of Perfect Graphs. SIAM J. Discret. Math. 18(3): 571-576 (2004) - [c2]Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan:
The list partition problem for graphs. SODA 2004: 391-399 - 2003
- [j37]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): 39-50 (2003) - [j36]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): 285-290 (2003) - 2002
- [j35]Chính T. Hoàng, Colin J. H. McDiarmid:
On the divisibility of graphs. Discret. Math. 242(1-3): 145-156 (2002) - [j34]Chính T. Hoàng:
On the disc-structure of perfect graphs II. The co-C4-structure. Discret. Math. 252(1-3): 141-159 (2002) - 2001
- [j33]Chính T. Hoàng, Van Bang Le:
P4-Colorings and P4-Bipartite Graphs. Discret. Math. Theor. Comput. Sci. 4(2): 109-122 (2001) - [j32]Chính T. Hoàng, R. Sritharan:
Finding houses and holes in graphs. Theor. Comput. Sci. 259(1-2): 233-244 (2001) - 2000
- [j31]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. Comput. Geom. 16(4): 235-243 (2000) - [j30]Chính T. Hoàng, Van Bang Le:
On P4-transversals of perfect graphs. Discret. Math. 216(1-3): 195-210 (2000) - [j29]Chính T. Hoàng, Xiaodan Tu:
On the perfect orderability of unions of two graphs. J. Graph Theory 33(1): 32-43 (2000) - [j28]Chính T. Hoàng, Van Bang Le:
Recognizing Perfect 2-Split Graphs. SIAM J. Discret. Math. 13(1): 48-55 (2000)
1990 – 1999
- 1999
- [j27]Chính T. Hoàng:
On the Disc-structure of Perfect Graphs I the Co-paw-structure. Discret. Appl. Math. 94(1-3): 247-262 (1999) - [j26]Chính T. Hoàng, Frédéric Maffray, Marc Noy:
A characterization of P4-indifference graphs. J. Graph Theory 31(3): 155-162 (1999) - 1997
- [c1]Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy:
Planar segment visibility graphs. CCCG 1997 - 1996
- [j25]Chính T. Hoàng:
A Note on Perfectly orderable Graphs. Discret. Appl. Math. 65(1-3): 379-386 (1996) - [j24]Chính T. Hoàng:
on the Complexity of Recognizing a Class of Perfectly orderable Graphs. Discret. Appl. Math. 66(3): 219-226 (1996) - [j23]Chính T. Hoàng:
Some properties of minimal imperfect graphs. Discret. Math. 160(1-3): 165-175 (1996) - [j22]Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray:
On the P4-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory B 67(2): 212-237 (1996) - 1995
- [j21]Chính T. Hoàng:
Hamiltonian degree conditions for tough graphs. Discret. Math. 142(1-3): 121-139 (1995) - [j20]Chính T. Hoàng:
On the two-edge-colorings of perfect graphs. J. Graph Theory 19(2): 271-279 (1995) - 1994
- [j19]Chính T. Hoàng:
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. Discret. Appl. Math. 55(2): 133-143 (1994) - 1992
- [j18]Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann:
A charming class of perfectly orderable graphs. Discret. Math. 102(1): 67-74 (1992) - [j17]Chính T. Hoàng, Frédéric Maffray:
On slim graphs, even pairs, and star-cutsets. Discret. Math. 105(1-3): 93-102 (1992) - [j16]Chính T. Hoàng:
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. Theor. Comput. Sci. 99(2): 335-344 (1992) - 1991
- [j15]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): 161-174 (1991) - 1990
- [j14]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 6(1): 33-35 (1990) - [j13]Chính T. Hoàng:
On the sibling-structure of perfect graphs. J. Comb. Theory B 49(2): 282-286 (1990)
1980 – 1989
- 1989
- [j12]Chính T. Hoàng, Nadimpalli V. R. Mahadev:
A note on perfect orders. Discret. Math. 74(1-2): 77-84 (1989) - [j11]Chính T. Hoàng, Bruce A. Reed:
P4-comparability graphs. Discret. Math. 74(1-2): 173-200 (1989) - [j10]Chính T. Hoàng, Frédéric Maffray:
Opposition graphs are strict quasi-parity graphs. Graphs Comb. 5(1): 83-85 (1989) - [j9]Ryan Hayward, Chính T. Hoàng, Frédéric Maffray:
Optimizing weakly triangulated graphs. Graphs Comb. 5(1): 339-349 (1989) - [j8]Chính T. Hoàng, Bruce A. Reed:
Some classes of perfectly orderable graphs. J. Graph Theory 13(4): 445-463 (1989) - 1988
- [j7]Chính T. Hoàng, N. Khouzam:
On brittle graphs. J. Graph Theory 12(3): 391-404 (1988) - 1987
- [j6]Chính T. Hoàng, Bruce A. Reed:
A note on short cycles in diagraphs. Discret. Math. 66(1-2): 103-107 (1987) - [j5]Chính T. Hoàng:
Alternating orientation and alternating colouration of perfect graphs. J. Comb. Theory B 42(3): 264-273 (1987) - [j4]Chính T. Hoàng:
On a conjecture of Meyniel. J. Comb. Theory B 42(3): 302-312 (1987) - [j3]Vasek Chvátal, Chính T. Hoàng, Nadimpalli V. R. Mahadev, Dominique de Werra:
Four classes of perfectly orderable graphs. J. Graph Theory 11(4): 481-495 (1987) - 1985
- [j2]Vasek Chvátal, Chính T. Hoàng:
On the P4-structure of perfect graphs I. Even decompositions. J. Comb. Theory B 39(3): 209-219 (1985) - [j1]Chính T. Hoàng:
On the P4-structure of perfect graphs. II. Odd decompositions. J. Comb. Theory B 39(3): 220-232 (1985)
Coauthor Index
Angèle M. Foley
aka: Angèle M. Hamel
aka: Angèle M. Hamel
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: