The b-chromatic number χb(G) of a graph G is the maximum k for which there is a function c:V(G)→{1,2,…,k} such that c(x)≠c(y) for any edge xy, and for every i there exists a vertex x assigned i adjacent to some vertex y assigned j for any j≠i. In general, χ(G)≤χb(G)≤m(G)≤Δ(G)+1, where Δ(G) is the maximum degree of G and m(G) is the largest integer m such that G has at least m vertices of degree at least m−1. A graph G is tight if there are exactly m(G) vertices of degree m(G)−1 and all other vertices have degree less than m(G)−1. This paper discusses a relation between b-chromatic numbers of tight bipartite graphs and the Erdős–Faber–Lovász Conjecture.