Chính T. Hoàng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Chính T. Hoàng has a total of 2 co-authors. Here are the top co-authors by number of shared publications:
Frédéric Maffray
C.N.R.S, Laboratoire G‐Scop, UMR 5272, Grenoble‐Inp UJF‐Grenoble 1 Grenoble France
1 shared publicationMeriem Mechebbek
Usthb, Laboratoire Laid3 Bp32 El Alia Bab Ezzouar 16111 Alger Algeria
1 shared publication
Latest Publications
- 1 December 2011
- Published by Wiley in Journal of Graph Theory
- Vol. 71 (1) , 95-122
A Characterization of b‐Perfect Graphs
A b‐coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b‐chromatic number of a graph G is the largest integer k such that G admits a b‐coloring with k colors. A graph is b‐perfect if the b‐chromatic number is equal to the chromatic number for every induced subgraph of G. We prove that a graph is b‐perfect if and only if it does not contain as an induced subgraph a member of a certain list of 22 graphs. This entails the existence of a polynomial‐time recognition algorithm and of a polynomial‐time algorithm for coloring exactly the vertices of every b‐perfect graph. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:95–122, 2012
- 1 December 2011
- Published by Wiley in Journal of Graph Theory
- Vol. 71 (1) , 95-122
A Characterization of b‐Perfect Graphs
A b‐coloring is a coloring of the vertices of a graph such that each color class contains a vertex that has a neighbor in all other color classes, and the b‐chromatic number of a graph G is the largest integer k such that G admits a b‐coloring with k colors. A graph is b‐perfect if the b‐chromatic number is equal to the chromatic number for every induced subgraph of G. We prove that a graph is b‐perfect if and only if it does not contain as an induced subgraph a member of a certain list of 22 graphs. This entails the existence of a polynomial‐time recognition algorithm and of a polynomial‐time algorithm for coloring exactly the vertices of every b‐perfect graph. © 2011 Wiley Periodicals, Inc. J Graph Theory 71:95–122, 2012