The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Chính T. Hoàng" ( http://dblp.L3S.de/Authors/Chính_T._Hoàng )

  Author page on DBLP  Author page in RDF  Community of Chính T. Hoàng in ASPL-2

Publication years (Num. hits)
1985-1992 (15) 1994-2002 (15) 2003-2007 (16) 2008-2011 (17) 2012 (2)
Publication types (Num. hits)
article(60) inproceedings(5)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 3 occurrences of 3 keywords

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