Hegde, S.M.Dara, S.2026-02-032025Electronic Journal of Graph Theory and Applications, 2025, 13, 1, pp. 117-12123382287https://doi.org/10.5614/ejgta.2025.13.1.8https://idr.nitk.ac.in/handle/123456789/20697We consider the Erd?s - Faber - Lovász (EFL) conjecture for hypergraphs. This paper gives an upper bound for the chromatic number of r regular linear hypergraphs H of size n. If r ? 4, ?(H) ? 1.181n and if r = 3, ?(H) ? 1.281n. © (2025), (Indonesian Combinatorics Society). All rights reserved.chromatic numberErd?s - Faber - Lovász conjecturehypergraphs