A note on approximating the \(b\)-chromatic number
type: Item
instance of: scholarly article
title: A note on approximating the \(b\)-chromatic number
zbMATH Open document ID: 1262.05051
author: František Galčík
author: Ján Katrenič
published in: Discrete Applied Mathematics
publication date: 2013-04-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6157675
zbMATH Keywords: \(b\)-coloring
zbMATH Keywords: \(b\)-chromatic number
zbMATH Keywords: approximation
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
full work available at URL: j.dam.2012.11.008
OpenAlex ID: W2068187455
cites work: On \(b\)-colorings in regular graphs
cites work: On the b-coloring of cographs and \(P_{4}\)-sparse graphs
cites work: \(B\)-chromatic number of cacti
cites work: On approximating the b-chromatic number
cites work: On the b-chromatic number of Kneser graphs
cites work: Clique is hard to approximate within \(n^{1-\epsilon}\)
cites work: The b-chromatic number of a graph
cites work: The b-chromatic number of cubic graphs
cites work: Q4414507
cites work: \(B\)-coloring of \(m\)-tight graphs
cites work: Q3002782
DOI: 10.1016/J.DAM.2012.11.008
description: scientific article; zbMATH DE number 6157675