Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
6871681 | Discrete Applied Mathematics | 2018 | 18 Pages |
Abstract
The b-chromatic number of a graph G is the largest integer k such that G admits a proper k-coloring in which every color class contains at least one vertex that has a neighbor in each of the other color classes. In this survey we present the most important results on b-colorings, b-chromatic number, and related topics.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Marko Jakovac, Iztok Peterin,