Abuadas, Tala; Cameron, Ben; Hoàng, Chính T.; Sawada, Joe Vertex-critical \(( P_3 + \ell P_1 )\)-free and vertex-critical (gem, co-gem)-free graphs. (English) Zbl 07781878 Discrete Appl. Math. 344, 179-187 (2024). MSC: 05C15 68Q25 68R10 05C85 PDFBibTeX XMLCite \textit{T. Abuadas} et al., Discrete Appl. Math. 344, 179--187 (2024; Zbl 07781878) Full Text: DOI arXiv
Cameron, Ben; Hoàng, Chính T. A refinement on the structure of vertex-critical \((P_5, \mathrm{gem})\)-free graphs. (English) Zbl 1528.05021 Theor. Comput. Sci. 961, Article ID 113936, 8 p. (2023). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{B. Cameron} and \textit{C. T. Hoàng}, Theor. Comput. Sci. 961, Article ID 113936, 8 p. (2023; Zbl 1528.05021) Full Text: DOI arXiv
Dai, Yingjun; Foley, Angèle M.; Hoàng, Chính T. On coloring a class of claw-free and hole-twin-free graphs. (English) Zbl 07610739 Discrete Appl. Math. 323, 162-170 (2022). MSC: 68Qxx 05Cxx 68Rxx PDFBibTeX XMLCite \textit{Y. Dai} et al., Discrete Appl. Math. 323, 162--170 (2022; Zbl 07610739) Full Text: DOI
Abuadas, Tala; Hoàng, Chính T. On the structure of graphs without claw, \(4K_1\) and co-R. (English) Zbl 1493.05091 Graphs Comb. 38, No. 4, Paper No. 123, 19 p. (2022). MSC: 05C15 05C75 05C76 68Q25 PDFBibTeX XMLCite \textit{T. Abuadas} and \textit{C. T. Hoàng}, Graphs Comb. 38, No. 4, Paper No. 123, 19 p. (2022; Zbl 1493.05091) Full Text: DOI
Dai, Yingjun; Foley, Angèle M.; Hoàng, Chính T. Vertex coloring \((4K_1\), hole-twin, 5-wheel)-free graphs. (English) Zbl 1493.68263 Theor. Comput. Sci. 914, 14-22 (2022). Reviewer: Xueliang Li (Tianjin) MSC: 68R10 05C15 05C85 68Q25 PDFBibTeX XMLCite \textit{Y. Dai} et al., Theor. Comput. Sci. 914, 14--22 (2022; Zbl 1493.68263) Full Text: DOI
Foley, Angèle M.; Fraser, Dallas J.; Hoàng, Chính T.; Holmes, Kevin; Lamantia, Tom P. The intersection of two vertex coloring problems. (English) Zbl 1434.05052 Graphs Comb. 36, No. 1, 125-138 (2020). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{A. M. Foley} et al., Graphs Comb. 36, No. 1, 125--138 (2020; Zbl 1434.05052) Full Text: DOI arXiv
Dai, Yingjun; Foley, Angèle M.; Hoàng, Chính T. On coloring a class of claw-free graphs. (English) Zbl 07515195 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 369-377 (2019). MSC: 05Cxx 90Cxx PDFBibTeX XMLCite \textit{Y. Dai} et al., Electron. Notes Theor. Comput. Sci. 346, 369--377 (2019; Zbl 07515195) Full Text: DOI
Fraser, Dallas J.; Hamel, Angèle M.; Hoàng, Chính T.; Maffray, Frédéric A coloring algorithm for \(4 K_1\)-free line graphs. (English) Zbl 1376.05054 Discrete Appl. Math. 234, 76-85 (2018). MSC: 05C15 PDFBibTeX XMLCite \textit{D. J. Fraser} et al., Discrete Appl. Math. 234, 76--85 (2018; Zbl 1376.05054) Full Text: DOI
Fraser, Dallas J.; Hamel, Angèle M.; Hoàng, Chính T.; Holmes, Kevin; LaMantia, Tom P. Characterizations of \((4 K_1,C_4,C_5)\)-free graphs. (English) Zbl 1369.05075 Discrete Appl. Math. 231, 166-174 (2017). MSC: 05C15 05C17 PDFBibTeX XMLCite \textit{D. J. Fraser} et al., Discrete Appl. Math. 231, 166--174 (2017; Zbl 1369.05075) Full Text: DOI
Hoàng, Chính T.; Lazzarato, D. Adam Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes. (English) Zbl 1311.05064 Discrete Appl. Math. 186, 106-111 (2015). MSC: 05C15 05C35 05C22 05C85 PDFBibTeX XMLCite \textit{C. T. Hoàng} and \textit{D. A. Lazzarato}, Discrete Appl. Math. 186, 106--111 (2015; Zbl 1311.05064) Full Text: DOI arXiv
Hoàng, Chính T.; Kamiński, Marcin; Lozin, Vadim; Sawada, Joe; Shu, Xiao Deciding \(k\)-colorability of \(P_5\)-free graphs in polynomial time. (English) Zbl 1222.68083 Algorithmica 57, No. 1, 74-81 (2010). MSC: 68Q17 05C85 68R10 PDFBibTeX XMLCite \textit{C. T. Hoàng} et al., Algorithmica 57, No. 1, 74--81 (2010; Zbl 1222.68083) Full Text: DOI
Hoàng, Chính T.; Kamiński, Marcin; Lozin, Vadim; Sawada, Joe; Shu, Xiao A note on \(k\)-colorability of \(P _{5}\)-free graphs. (English) Zbl 1173.05351 Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 387-394 (2008). MSC: 05C85 05C15 05C69 68Q25 PDFBibTeX XMLCite \textit{C. T. Hoàng} et al., Lect. Notes Comput. Sci. 5162, 387--394 (2008; Zbl 1173.05351) Full Text: DOI
Brandstädt, Andreas; Hoàng, Chính T. On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem. (English) Zbl 1143.68059 Theor. Comput. Sci. 389, No. 1-2, 295-306 (2007). MSC: 68R10 05C69 05C70 68Q85 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{C. T. Hoàng}, Theor. Comput. Sci. 389, No. 1--2, 295--306 (2007; Zbl 1143.68059) Full Text: DOI
Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D. T.; Sritharan, R. Disjoint clique cutsets in graphs without long holes. (English) Zbl 1061.05067 J. Graph Theory 48, No. 4, 277-298 (2005). MSC: 05C69 05C17 05C85 05C15 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., J. Graph Theory 48, No. 4, 277--298 (2005; Zbl 1061.05067) Full Text: DOI
Hoàng, Chính T. On the disc-structure of perfect graphs. I: The co-paw-structure. (English) Zbl 0941.05030 Discrete Appl. Math. 94, No. 1-3, 247-262 (1999). Reviewer: T.Andreae (Hamburg) MSC: 05C17 05C15 05C60 05C75 PDFBibTeX XMLCite \textit{C. T. Hoàng}, Discrete Appl. Math. 94, No. 1--3, 247--262 (1999; Zbl 0941.05030) Full Text: DOI
Hoàng, Chính T. Some properties of minimal imperfect graphs. (English) Zbl 0863.05055 Discrete Math. 160, No. 1-3, 165-175 (1996). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C60 05C38 05C35 05C15 PDFBibTeX XMLCite \textit{C. T. Hoàng}, Discrete Math. 160, No. 1--3, 165--175 (1996; Zbl 0863.05055) Full Text: DOI
Hoàng, Chính T. Efficient algorithms for minimum weighted colouring of some classes of perfect graphs. (English) Zbl 0815.68076 Discrete Appl. Math. 55, No. 2, 133-143 (1994). MSC: 68R10 05C15 68Q25 PDFBibTeX XMLCite \textit{C. T. Hoàng}, Discrete Appl. Math. 55, No. 2, 133--143 (1994; Zbl 0815.68076) Full Text: DOI
Hoàng, Chính T.; Maffray, Frédéric On slim graphs, even pairs, and star-cutsets. (English) Zbl 0769.05087 Discrete Math. 105, No. 1-3, 93-102 (1992). Reviewer: H.T.Lau (Verdun / Quebec) MSC: 05C99 PDFBibTeX XMLCite \textit{C. T. Hoàng} and \textit{F. Maffray}, Discrete Math. 105, No. 1--3, 93--102 (1992; Zbl 0769.05087) Full Text: DOI
Hoàng, C. T. On the sibling-structure of perfect graphs. (English) Zbl 0725.05060 J. Comb. Theory, Ser. B 49, No. 2, 282-286 (1990). Reviewer: J.Sedláček (Praha) MSC: 05C60 05C99 PDFBibTeX XMLCite \textit{C. T. Hoàng}, J. Comb. Theory, Ser. B 49, No. 2, 282--286 (1990; Zbl 0725.05060) Full Text: DOI
Hayward, Ryan; Hoàng, Chính; Maffray, Frédéric Optimizing weakly triangulated graphs. (English) Zbl 0679.68082 Graphs Comb. 5, No. 4, 339-349 (1989). MSC: 68Q25 68R10 05C99 PDFBibTeX XMLCite \textit{R. Hayward} et al., Graphs Comb. 5, No. 4, 339--349 (1989; Zbl 0679.68082) Full Text: DOI
Hoàng, C. T.; Maffray, F. Opposition graphs are strict quasi-parity graphs. (English) Zbl 0669.05045 Graphs Comb. 5, No. 1, 83-85 (1989). MSC: 05C38 PDFBibTeX XMLCite \textit{C. T. Hoàng} and \textit{F. Maffray}, Graphs Comb. 5, No. 1, 83--85 (1989; Zbl 0669.05045) Full Text: DOI
Hoàng, C. T. On a conjecture of Meyniel. (English) Zbl 0634.05058 J. Comb. Theory, Ser. B 42, 302-312 (1987). Reviewer: R.L.Hemminger MSC: 05C99 PDFBibTeX XMLCite \textit{C. T. Hoàng}, J. Comb. Theory, Ser. B 42, 302--312 (1987; Zbl 0634.05058) Full Text: DOI