Hi all and thanks in advance for your efforts.

I'm interested in 2-coloring 3-uniform hypergraphs. I know that in general, the problem of deciding if a 3-uniform hypergraph is 2-colorable is NP-hard. I wonder if there are any (non-trivial) subclasses of 3-uniform hypergraphs for which there exists a polynomial algorithm for 2-coloring. For example, are there some $H_1,...,H_k$ for which the class of $(H_1,...,H_k)$-free 3-uniform hypergraphs has a polynomial algorithm for 2-coloring? Are there any results of this type?

Thanks, Lior