Chính T. Hoàng

2008
47	EE	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
46	EE	Andreas Brandstädt, Chính T. Hoàng: Maximum Induced Matchings for Chordal Graphs in Linear Time. Algorithmica 52(4): 440-447 (2008)
45	EE	Chính T. Hoàng: On the complexity of finding a sun in a graph CoRR abs/0807.0462: (2008)
44	EE	Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque: Asteroids in rooted and directed path graphs CoRR abs/0812.2734: (2008)
2007
43	EE	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)
42	EE	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)
41	EE	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)
2006
40	EE	Chính T. Hoàng, Joe Sawada, Xiao Shu: k-Colorability of P5-free graphs CoRR abs/cs/0609083: (2006)
39	EE	Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray: A characterization of P4-comparability graphs. Discrete Mathematics 306(19-20): 2461-2472 (2006)
38	EE	Kathie Cameron, Chính T. Hoàng: On the structure of certain intersection graphs. Inf. Process. Lett. 99(2): 59-63 (2006)
37	EE	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)
2005
36	EE	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
35	EE	Chính T. Hoàng, Mekkia Kouider: On the b-dominating coloring of graphs. Discrete Applied Mathematics 152(1-3): 176-186 (2005)
34	EE	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)
2004
33	EE	Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan: The list partition problem for graphs. SODA 2004: 391-399
32	EE	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)
31	EE	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)
30	EE	Chính T. Hoàng, Bruce A. Reed: On the Co-P3-Structure of Perfect Graphs. SIAM J. Discrete Math. 18(3): 571-576 (2004)
2003
29	EE	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)
28	EE	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)
2002
27	EE	Chính T. Hoàng, Colin J. H. McDiarmid: On the divisibility of graphs. Discrete Mathematics 242(1-3): 145-156 (2002)
26	EE	Chính T. Hoàng: On the disc-structure of perfect graphs II. The co-C4-structure. Discrete Mathematics 252(1-3): 141-159 (2002)
2001
25	EE	Chính T. Hoàng, Van Bang Le: P4-Colorings and P4-Bipartite Graphs. Discrete Mathematics & Theoretical Computer Science 4(2): 109-122 (2001)
24	EE	Chính T. Hoàng, R. Sritharan: Finding houses and holes in graphs. Theor. Comput. Sci. 259(1-2): 233-244 (2001)
2000
23		Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy: Planar segment visibility graphs. Comput. Geom. 16(4): 235-243 (2000)
22	EE	Chính T. Hoàng, Van Bang Le: On P4-transversals of perfect graphs. Discrete Mathematics 216(1-3): 195-210 (2000)
21	EE	Chính T. Hoàng, Van Bang Le: Recognizing Perfect 2-Split Graphs. SIAM J. Discrete Math. 13(1): 48-55 (2000)
1999
20	EE	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)
1997
19		Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy: Planar segment visibility graphs. CCCG 1997
1996
18	EE	Chính T. Hoàng: A Note on Perfectly orderable Graphs. Discrete Applied Mathematics 65(1-3): 379-386 (1996)
17	EE	Chính T. Hoàng: on the Complexity of Recognizing a Class of Perfectly orderable Graphs. Discrete Applied Mathematics 66(3): 219-226 (1996)
16	EE	Chính T. Hoàng: Some properties of minimal imperfect graphs. Discrete Mathematics 160(1-3): 165-175 (1996)
15	EE	Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray: On the P4-Structure of Perfect Graphs V. Overlap Graphs. J. Comb. Theory, Ser. B 67(2): 212-237 (1996)
1995
14	EE	Chính T. Hoàng: Hamiltonian degree conditions for tough graphs. Discrete Mathematics 142(1-3): 121-139 (1995)
1994
13	EE	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)
1992
12	EE	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)
11	EE	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)
10		Chính T. Hoàng: A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. Theor. Comput. Sci. 99(2): 335-344 (1992)
1991
9	EE	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)
1990
8	EE	Chính T. Hoàng: On the sibling-structure of perfect graphs. J. Comb. Theory, Ser. B 49(2): 282-286 (1990)
1989
7	EE	Chính T. Hoàng, Bruce A. Reed: P4-comparability graphs. Discrete Mathematics 74(1-2): 173-200 (1989)
6	EE	Chính T. Hoàng, Nadimpalli V. R. Mahadev: A note on perfect orders. Discrete Mathematics 74(1-2): 77-84 (1989)
1987
5	EE	Chính T. Hoàng, Bruce A. Reed: A note on short cycles in diagraphs. Discrete Mathematics 66(1-2): 103-107 (1987)
4	EE	Chính T. Hoàng: Alternating orientation and alternating colouration of perfect graphs. J. Comb. Theory, Ser. B 42(3): 264-273 (1987)
3	EE	Chính T. Hoàng: On a conjecture of Meyniel. J. Comb. Theory, Ser. B 42(3): 302-312 (1987)
1985
2	EE	Vasek Chvátal, Chính T. Hoàng: On the P4-structure of perfect graphs I. Even decompositions. J. Comb. Theory, Ser. B 39(3): 209-219 (1985)
1	EE	Chính T. Hoàng: On the P4-structure of perfect graphs. II. Odd decompositions. J. Comb. Theory, Ser. B 39(3): 220-232 (1985)

Coauthor Index

1	Andreas Brandstädt	[29] [31] [36] [41] [46]
2	Kathie Cameron	[33] [38] [42] [44]
3	Vasek Chvátal	[2]
4	Elaine M. Eschen	[33] [34] [42]
5	Hazel Everett	[19] [23]
6	Celina M. Herrera de Figueiredo	[39]
7	Ion Gorgos	[37]
8	Sylvain Gravier	[28]
9	Stefan Hougardy	[15] [32]
10	Marcin Kaminski	[43] [47]
11	Kyriakos Kilakos	[19] [23]
12	Mekkia Kouider	[35]
13	Van Bang Le	[21] [22] [25] [29]
14	Benjamin Lévêque	[44]
15	Vadim V. Lozin	[43] [47]
16	Frédéric Maffray	[9] [11] [12] [15] [28] [32] [39]
17	Nadimpalli V. R. Mahadev	[6] [32]
18	Colin McDiarmid (Colin J. H. McDiarmid)	[27]
19	Marc Noy	[19] [23]
20	Stephan Olariu	[12]
21	Mark D. T. Petrick	[34]
22	Myriam Preissmann	[9] [12]
23	Bruce A. Reed	[5] [7] [30]
24	Joe Sawada	[40] [43] [47]
25	Xiao Shu	[40] [43] [47]
26	R. Sritharan	[24] [33] [34] [42]
27	Jean-Marie Vanherpe	[31]
28	Vitaly I. Voloshin	[37]

Colors in the list of coauthors