The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Chính T. Hoàng: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 1997, pp:- [Conf]
  2. Andreas Brandstädt, Chính T. Hoàng
    On Clique Separators, Nearly Chordal Graphs, and the Maximum Weight Stable Set Problem. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:265-275 [Conf]
  3. Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan
    The list partition problem for graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:391-399 [Conf]
  4. Hazel Everett, Chính T. Hoàng, Kyriakos Kilakos, Marc Noy
    Planar segment visibility graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:4, pp:235-243 [Journal]
  5. Andreas Brandstädt, Chính T. Hoàng, Van Bang Le
    Stability number of bull- and chair-free graphs revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:1, pp:39-50 [Journal]
  6. Chính T. Hoàng
    Efficient Algorithms for Minimum Weighted Colouring of Some Classes of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1994, v:55, n:2, pp:133-143 [Journal]
  7. Chính T. Hoàng
    A Note on Perfectly orderable Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:65, n:1-3, pp:379-386 [Journal]
  8. Chính T. Hoàng
    on the Complexity of Recognizing a Class of Perfectly orderable Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1996, v:66, n:3, pp:219-226 [Journal]
  9. Chính T. Hoàng
    On the Disc-structure of Perfect Graphs I the Co-paw-structure. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:94, n:1-3, pp:247-262 [Journal]
  10. Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray, Nadimpalli V. R. Mahadev
    On simplicial and co-simplicial vertices in graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:138, n:1-2, pp:117-132 [Journal]
  11. Chính T. Hoàng, Mekkia Kouider
    On the b-dominating coloring of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2005, v:152, n:1-3, pp:176-186 [Journal]
  12. Andreas Brandstädt, Chính T. Hoàng, Jean-Marie Vanherpe
    On minimal prime extensions of a four-vertex graph in a prime graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:288, n:1-3, pp:9-17 [Journal]
  13. Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray
    Coloring the hypergraph of maximal cliques of a graph with no long path. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:272, n:2-3, pp:285-290 [Journal]
  14. Chính T. Hoàng
    On the disc-structure of perfect graphs II. The co-C4-structure. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:252, n:1-3, pp:141-159 [Journal]
  15. Chính T. Hoàng, Van Bang Le
    On P4-transversals of perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:216, n:1-3, pp:195-210 [Journal]
  16. Chính T. Hoàng, Colin J. H. McDiarmid
    On the divisibility of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:242, n:1-3, pp:145-156 [Journal]
  17. Celina M. Herrera de Figueiredo, Chính T. Hoàng, Frédéric Maffray
    A characterization of P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2006, v:306, n:19-20, pp:2461-2472 [Journal]
  18. Chính T. Hoàng, Van Bang Le
    P4-Colorings and P4-Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics & Theoretical Computer Science, 2001, v:4, n:2, pp:109-122 [Journal]
  19. Kathie Cameron, Chính T. Hoàng
    On the structure of certain intersection graphs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:2, pp:59-63 [Journal]
  20. Chính T. Hoàng
    Alternating orientation and alternating colouration of perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:264-273 [Journal]
  21. Chính T. Hoàng
    On a conjecture of Meyniel. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1987, v:42, n:3, pp:302-312 [Journal]
  22. Chính T. Hoàng
    On the sibling-structure of perfect graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1990, v:49, n:2, pp:282-286 [Journal]
  23. Chính T. Hoàng, Stefan Hougardy, Frédéric Maffray
    On the P4-Structure of Perfect Graphs V. Overlap Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1996, v:67, n:2, pp:212-237 [Journal]
  24. Chính T. Hoàng, Van Bang Le
    Recognizing Perfect 2-Split Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2000, v:13, n:1, pp:48-55 [Journal]
  25. Chính T. Hoàng, Bruce A. Reed
    On the Co-P3-Structure of Perfect Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:571-576 [Journal]
  26. Chính T. Hoàng
    A Parallel Algorithm for Minimum Weighted Colouring of Triangulated Graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:99, n:2, pp:335-344 [Journal]
  27. Chính T. Hoàng, R. Sritharan
    Finding houses and holes in graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:233-244 [Journal]
  28. Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan
    Disjoint clique cutsets in graphs without long holes. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:48, n:4, pp:277-298 [Journal]
  29. Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, J. Sawada, X. Shu
    Deciding k-colourability of P_5-free graphs in polynomial time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  30. C. T. Hoang, J. Sawada, X. Shu
    k-Colorability of P5-free graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  31. Chính T. Hoàng, Bruce A. Reed
    A note on short cycles in diagraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:1-2, pp:103-107 [Journal]
  32. Chính T. Hoàng, Nadimpalli V. R. Mahadev
    A note on perfect orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:77-84 [Journal]
  33. Chính T. Hoàng, Bruce A. Reed
    P4-comparability graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:74, n:1-2, pp:173-200 [Journal]
  34. Chính T. Hoàng, Frédéric Maffray, Myriam Preissmann
    New properties of perfectly orderable graphs and strongly perfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:98, n:3, pp:161-174 [Journal]
  35. Chính T. Hoàng, Frédéric Maffray, Stephan Olariu, Myriam Preissmann
    A charming class of perfectly orderable graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:102, n:1, pp:67-74 [Journal]
  36. Chính T. Hoàng, Frédéric Maffray
    On slim graphs, even pairs, and star-cutsets. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:105, n:1-3, pp:93-102 [Journal]
  37. Chính T. Hoàng
    Hamiltonian degree conditions for tough graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:142, n:1-3, pp:121-139 [Journal]
  38. Chính T. Hoàng
    Some properties of minimal imperfect graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:160, n:1-3, pp:165-175 [Journal]

  39. A Certifying Algorithm for 3-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  40. A Note on k-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  41. Maximum Induced Matchings for Chordal Graphs in Linear Time. [Citation Graph (, )][DBLP]


  42. Deciding k-Colorability of P5-Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  43. On the complexity of finding a sun in a graph [Citation Graph (, )][DBLP]


  44. Asteroids in rooted and directed path graphs [Citation Graph (, )][DBLP]


  45. On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two [Citation Graph (, )][DBLP]


  46. A certifying algorithm for 3-colorability of P5-free graphs [Citation Graph (, )][DBLP]


  47. On graphs without a C4 or a diamond [Citation Graph (, )][DBLP]


  48. Finding a sun in building-free graphs [Citation Graph (, )][DBLP]


  49. A characterization of b-perfect graphs [Citation Graph (, )][DBLP]


  50. On minimally b-imperfect graphs. [Citation Graph (, )][DBLP]


Search in 0.034secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002