A Characterization of b-Perfect Graphs

@article{Hong2012ACO,
  title={A Characterization of b-Perfect Graphs},
  author={C. Ho{\`a}ng and Fr{\'e}d{\'e}ric Maffray and Meriem Mechebbek},
  journal={ArXiv},
  year={2012},
  volume={abs/1004.5306}
}
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… Expand
B-chromatic Index of Graphs
The b-chromatic index of graphs
On the b-coloring of P 4-tidy graphs
On the b-coloring of P4-tidy graphs
A characterization of edge b-critical graphs
On quasi-monotonous graphs
  • M. Kouider
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2016
Graphs with small fall-spectrum
  • A. Silva
  • Computer Science, Mathematics
  • Discret. Appl. Math.
  • 2019
Solving the graph b-coloring problem with hybrid genetic algorithm
A characterization of b-chromatic and partial
...
1
2
3
...

References

SHOWING 1-10 OF 31 REFERENCES
On minimally b-imperfect graphs
On the b-dominating coloring of graphs
The b-chromatic Number of a Graph
On the b-Chromatic Number of Graphs
On b-perfect Chordal Graphs
Weakly triangulated graphs
  • R. Hayward
  • Computer Science, Mathematics
  • J. Comb. Theory, Ser. B
  • 1985
Simple, linear-time modular decomposition
...
1
2
3
4
...