On the b-coloring of tight graphs

DOI10.1007/S10878-015-9946-YzbMath1358.05108OpenAlexW2189218832MaRDI QIDQ512879

Mohamed Zamime, Mekkia Kouider

Publication date: 3 March 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9946-y

zbMATH Keywords

tight graphscoloring\(b\)-coloring\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (2)

The \(b\)-chromatic number and related topics -- a survey ⋮ On b-acyclic chromatic number of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• On quasi-monotonous graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• The b-chromatic number of a graph
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• On the \(b\)-chromatic number of regular bounded graphs
• On vertex b-critical trees
• Bounds for the b-chromatic number of vertex-deleted subgraphs and the extremal graphs

This page was built for publication: On the b-coloring of tight graphs