On b-perfect Chordal Graphs

Authors:
Frédéric Maffray;Meriem Mechebbek
Affiliations:
CNRS, Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031, Grenoble Cedex, France;USTHB, Laboratoire LAID3, BP32 El Alia, 16111, Bab Ezzouar, Alger, Algeria
Venue:
Graphs and Combinatorics
Year:
2009

Citing 0
Cited 3

Recolouring-resistant colourings

Discrete Applied Mathematics
A Characterization of b-Perfect Graphs

Journal of Graph Theory
Maximization coloring problems on graphs with few P4

Discrete Applied Mathematics

Quantified Score

Hi-index	0.00

Visualization

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.