The b-chromatic number and related topics—A survey

The b-chromatic number and related topics—A survey

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,...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2018-01, Vol.235, p.184-201
Hauptverfasser: Jakovac, Marko, Peterin, Iztok
Format: Artikel
Sprache:eng
Schlagworte:
b-chromatic index
b-chromatic number
b-colorings
b-continuous graphs
b-critical graphs
b-perfect graphs
Color
Coloring
Integer programming
Studies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.08.008