On lower bounds for the b-chromatic number of connected bipartite graphs

DOI10.1016/j.endm.2011.05.068zbMath1268.05078OpenAlexW1974556663MaRDI QIDQ2840743

Mario Valencia-Pabon, Mekkia Kouider

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.068

zbMATH Keywords

bipartite graphslower bounds\(b\)-chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (1)

The \(b\)-chromatic number and related topics -- a survey

Cites Work

• The b-chromatic number of a graph
• Some bounds for the \(b\)-chromatic number of a graph
• Unnamed Item

This page was built for publication: On lower bounds for the b-chromatic number of connected bipartite graphs