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

DOI10.7151/DMGT.1575zbMATH Open1255.05072OpenAlexW2025962792MaRDI QIDQ2906356FDOQ2906356

Authors: Mais Alkhateeb, Anja Kohl 

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

Recommendations

• The \(b\)-continuity of some special corona graphs
• The \(b\)-coloring and \(b\)-continuity of the cartesian product of some graphs
• Bounds for the \(b\)-chromatic number of \(G-v\)
• Some bounds for the \(b\)-chromatic number of a graph
• Bounds for the \(b\)-chromatic number of induced subgraphs and \(G - e\)

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (18)

• New bounds for the \(b\)-chromatic number of vertex deleted graphs
• The \(b\)-chromatic number and related topics -- a survey
• Title not available (Why is that?)
• 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
• Beyond Ohba's conjecture: a bound on the choice number of \(k\)-chromatic graphs with \(n\) vertices
• \(b\)-continuity and the lexicographic product of graphs
• On the \(b\)-coloring of \(P_{4}\)-tidy graphs
• Bounds for the \(b\)-chromatic number of subgraphs and edge-deleted subgraphs
• On the \(b\)-continuity property of graphs
• On the \(b\)-continuity of the lexicographic product of graphs
• The \(b\)-continuity of graphs with large girth
• Some properties on the \(b\)-chromatic number of special graphs
• Title not available (Why is that?)
• \(b\)-coloring of some bipartite graphs
• Bounds for the \(b\)-chromatic number of induced subgraphs and \(G - e\)
• On the upper and lower chromatic numbers of BSQSs(16)
• On lower bounds for the \(b\)-chromatic number of connected bipartite graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2906356)