On b-perfect chordal graphsReport as inadecuate

On b-perfect chordal graphs - Download this document for free, or read online. Document in PDF available to download.

1 G-SCOP OC - OC G-SCOP - Laboratoire des sciences pour la conception, l-optimisation et la production 2 Laboratoire LAID3

Abstract : The b-chromatic number of a graph G is the largest integer k such that G has a coloring of the vertices in k color classes such that every color class contains a vertex that has a neighbour in all other color classes. We characterize the class of chordal graphs for which the b-chromatic number is equal to the chromatic number for every induced subgraph.

Author: Frédéric Maffray - Meriem Mechebbek -

Source: https://hal.archives-ouvertes.fr/


Related documents