1. Agnarsson, G., Halldórsson, M.: Strong colorings of hypergraphs. In: G. Persiano (ed.) Approximation and Online Algorithms, pp. 253–266. Springer, Heidelberg (2005)
2. Annamalai, C.: Finding perfect matchings in bipartite hypergraphs (2016). http://arxiv.org/pdf/1509.07007.pdf
3. Banerjee, A.: On the spectrum of hypergraphs. arXiv:1711.09356v3 [math.CO] (2019). http://arxiv.org/pdf/1711.09356.pdf
4. Bretto, A.: Hypergraph Theory: An Introduction. Springer, Heidelberg (2013)
5. Cardoso, K., Trevisan, V.: The signless laplacian matrix of hypergraphs. arXiv:1909.00246v2 [math.SP] (2019). http://arxiv.org/pdf/1909.00246