Upper bounds on the b-chromatic number and results for restricted graph classes

DOI10.7151/DMGT.1575zbMath1255.05072OpenAlexW2025962792MaRDI QIDQ2906356

Anja Kohl, M. Alkhateeb

Publication date: 5 September 2012

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1575

zbMATH Keywords

coloring\(b\)-coloring\(b\)-continuity\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (5)

The \(b\)-chromatic number and related topics -- a survey ⋮ The \(b\)-continuity of graphs with large girth ⋮ On the \(b\)-continuity of the lexicographic product of graphs ⋮ Investigating the \(b\)-chromatic number of bipartite graphs by using the bicomplement ⋮ A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic

This page was built for publication: Upper bounds on the b-chromatic number and results for restricted graph classes