On the b-coloring of tight graphs

DOI10.1007/S10878-015-9946-YzbMATH Open1358.05108OpenAlexW2189218832MaRDI QIDQ512879FDOQ512879

Authors: Mekkia Kouider, Mohamed Zamime 

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

Recommendations

• \(B\)-coloring of \(m\)-tight graphs
• \(b\)-coloring of tight graphs
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• \(b\)-coloring graphs with girth at least 8
• Graphs of girth at least 7 have high \(b\)-chromatic number

zbMATH Keywords

coloring\(b\)-coloring\(b\)-chromatic numbertight graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• The b-chromatic number of a graph
• On vertex \(b\)-critical trees
• Characterization of some \(b\)-chromatic edge critical graphs
• On the b-coloring of cographs and \(P_{4}\)-sparse graphs
• On the \(b\)-chromatic number of regular bounded graphs
• Bounds for the \(b\)-chromatic number of vertex-deleted subgraphs and the extremal graphs
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• Title not available (Why is that?)
• On quasi-monotonous graphs

Cited In (7)

• The \(b\)-chromatic number and related topics -- a survey
• \(b\)-coloring of tight bipartite graphs and the Erdős-Faber-Lovász conjecture
• On the \(b\)-dominating coloring of graphs
• An integer programming approach to b-coloring
• \(b\)-coloring of tight graphs
• On b-acyclic chromatic number of a graph
• \(B\)-coloring of \(m\)-tight graphs

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

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