University of Isfahan Transactions on Combinatorics 2251-8657 3 2 2014 06 01 Decomposing hypergraphs into $k$-colorable hypergraphs 31 33 5146 10.22108/toc.2014.5146 EN Gholamreza Omidi Isfahan University of Technology Khosro Tajbakhsh Tarbiat Modares University Journal Article 2014 02 04 For a given hypergraph $H$ with chromatic number $\chi(H)$ and with no edge containing only one vertex‎, ‎it is shown that the minimum number $l$‎ ‎for which there exists a partition (also a covering) $\{E_1,E_2,\ldots,E_l\}$ for $E(H)$‎, ‎such that the hypergraph induced by‎ ‎$E_i$ for each $1\leq i\leq l$ is $k$-colorable‎, ‎is $\lceil‎ ‎\log_{k} \chi(H) \rceil$‎. https://toc.ui.ac.ir/article_5146_4ae421bcffe18957f7f88eb4ccd479b6.pdf