On b-perfect chordal graphs

Frédéric Maffray (1) , Meriem Mechebbek (2)

1 G-SCOP_OC - Optimisation Combinatoire
2 Laboratoire LAID3

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.

Domaines: Mathématique discrète [cs.DM]

Frédéric Maffray, Meriem Mechebbek. On b-perfect chordal graphs. Graphs and Combinatorics, 2009, 25, pp.365-375. ⟨hal-00189944⟩