|
|||||
|
|
On b-perfect Chordal Graphs |
|
| Authors: | Frédéric Maffray Meriem Mechebbek |
| Institution: | (1) CNRS, Laboratoire G-SCOP, 46 avenue Félix Viallet, 38031 Grenoble Cedex, France;(2) USTHB, Laboratoire LAID3, BP32 El Alia, Bab Ezzouar, 16111, Alger, Algeria |
| 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. This research was supported by Algerian-French program CMEP/Tassili 05 MDU 639. |
| Keywords: | b-coloring Chordal graph Forbidden subgraph |
| 本文献已被 SpringerLink 等数据库收录！ | |