A connected hypergraph H has a tree structure, i.e., H is a hypertree, if the removal of any edge from H results a disconnected hypergraph. The structure of hypertrees is described and its cycles are classified. Conditions satisfied by the dual and the transversal of hypertrees are defined and the conformality of hypertrees is described. © 1998 Elsevier Science Ltd. All rights reserved.
Nieminen, J., & Peltola, M. (1999). Hypertrees. Applied Mathematics Letters, 12(2), 35–38. https://doi.org/10.1016/S0893-9659(98)00145-1