A connected hypergraph H has a tree structure, i.e., H is a hypertree, if t
he removal of any edge from H results a disconnected hypergraph. The struct
ure of hypertrees is described and its cycles are classified. Conditions sa
tisfied by the dual and the transversal of hypertrees are defined and the c
onformality of hypertrees is described. (C) 1998 Elsevier Science Ltd. All
rights reserved.