| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a Sun in Building-Free Graphs.  |
Graphs and Combinatorics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Steven Chaplick, Chính T. Hoàng |
Edge Intersection Graphs of L-Shaped Paths in Grids  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | 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.  |
Discrete Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque |
Characterizing directed path graphs by forbidden asteroids.  |
Journal of Graph Theory  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond.  |
Discrete Applied Mathematics  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu |
Deciding k-Colorability of P5-Free Graphs in Polynomial Time.  |
Algorithmica  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek |
A characterization of b-perfect graphs  |
CoRR  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On the Complexity of Finding a Sun in a Graph.  |
SIAM J. Discrete Math.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque |
Asteroids in rooted and directed path graphs.  |
Electronic Notes in Discrete Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Daniel Bruce, Chính T. Hoàng, Joe Sawada |
A certifying algorithm for 3-colorability of P5-free graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a sun in building-free graphs  |
CoRR  |
2009 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Chính T. Hoàng, Cláudia Linhares Sales, Frédéric Maffray |
On minimally b-imperfect graphs.  |
Discrete Applied Mathematics  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Daniel Bruce, Chính T. Hoàng, Joe Sawada |
A Certifying Algorithm for 3-Colorability of P5-Free Graphs.  |
ISAAC  |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Chính T. Hoàng |
Maximum Induced Matchings for Chordal Graphs in Linear Time.  |
Algorithmica  |
2008 |
DBLP DOI BibTeX RDF |
Maximum induced matchings, Perfect elimination order, Lexicographic breadth-first search, Chordal graphs, Linear time algorithm |
| 1 | Chính T. Hoàng |
On the complexity of finding a sun in a graph  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | Kathie Cameron, Chính T. Hoàng, Benjamin Lévêque |
Asteroids in rooted and directed path graphs  |
CoRR  |
2008 |
DBLP BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
P 5-free graphs, dominating clique, graph coloring |
| 1 | Andreas Brandstädt, Chính T. Hoàng |
On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem.  |
Theor. Comput. Sci.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | 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.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Chính T. Hoàng |
On the structure of certain intersection graphs.  |
Inf. Process. Lett.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray |
A characterization of P4-comparability graphs.  |
Discrete Mathematics  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Joe Sawada, Xiao Shu |
k-Colorability of P5-free graphs  |
CoRR  |
2006 |
DBLP BibTeX RDF |
|
| 1 | Ion Gorgos, Chính T. Hoàng, Vitaly I. Voloshin |
A Note on Quasi-triangulated Graphs.  |
SIAM J. Discrete Math.  |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Mekkia Kouider |
On the b-dominating coloring of graphs.  |
Discrete Applied Mathematics  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Chính T. Hoàng |
On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem.  |
IPCO  |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Bruce A. Reed |
On the Co-P3-Structure of Perfect Graphs.  |
SIAM J. Discrete Math.  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The list partition problem for graphs.  |
SODA  |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | 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  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Chính T. Hoàng, Van Bang Le |
Stability number of bull- and chair-free graphs revisited.  |
Discrete Applied Mathematics  |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On the disc-structure of perfect graphs II. The co-C4-structure.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Colin J. H. McDiarmid |
On the divisibility of graphs.  |
Discrete Mathematics  |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, R. Sritharan |
Finding houses and holes in graphs.  |
Theor. Comput. Sci.  |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
P4-Colorings and P4-Bipartite Graphs.  |
Discrete Mathematics & Theoretical Computer Science  |
2001 |
DBLP BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
On P4-transversals of perfect graphs.  |
Discrete Mathematics  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Van Bang Le |
Recognizing Perfect 2-Split Graphs.  |
SIAM J. Discrete Math.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy |
Planar segment visibility graphs.  |
Comput. Geom.  |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On the Disc-structure of Perfect Graphs I the Co-paw-structure.  |
Discrete Applied Mathematics  |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy |
Planar segment visibility graphs.  |
CCCG  |
1997 |
DBLP BibTeX RDF |
|
| 1 | 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  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
Some properties of minimal imperfect graphs.  |
Discrete Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
A Note on Perfectly orderable Graphs.  |
Discrete Applied Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
on the Complexity of Recognizing a Class of Perfectly orderable Graphs.  |
Discrete Applied Mathematics  |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
Hamiltonian degree conditions for tough graphs.  |
Discrete Mathematics  |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs.  |
Discrete Applied Mathematics  |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs.  |
Theor. Comput. Sci.  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Frédéric Maffray |
On slim graphs, even pairs, and star-cutsets.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann |
A charming class of perfectly orderable graphs.  |
Discrete Mathematics  |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann |
New properties of perfectly orderable graphs and strongly perfect graphs.  |
Discrete Mathematics  |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On the sibling-structure of perfect graphs.  |
J. Comb. Theory, Ser. B  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Hayward, Chính T. Hoàng, Frédéric Maffray |
Optimizing weakly triangulated graphs.  |
Graphs and Combinatorics  |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Nadimpalli V. R. Mahadev |
A note on perfect orders.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Bruce A. Reed |
P4-comparability graphs.  |
Discrete Mathematics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Ryan Hayward, Chính T. Hoàng, Frédéric Maffray |
Optimizing weakly triangulated graphs.  |
Graphs and Combinatorics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Frédéric Maffray |
Opposition graphs are strict quasi-parity graphs.  |
Graphs and Combinatorics  |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On a conjecture of Meyniel.  |
J. Comb. Theory, Ser. B  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
Alternating orientation and alternating colouration of perfect graphs.  |
J. Comb. Theory, Ser. B  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng, Bruce A. Reed |
A note on short cycles in diagraphs.  |
Discrete Mathematics  |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Chính T. Hoàng |
On the P4-structure of perfect graphs. II. Odd decompositions.  |
J. Comb. Theory, Ser. B  |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Vasek Chvátal, Chính T. Hoàng |
On the P4-structure of perfect graphs I. Even decompositions.  |
J. Comb. Theory, Ser. B  |
1985 |
DBLP DOI BibTeX RDF |
|