Edge hypergraphs

The notion of line hypergraph is introduced. It is an immediate generalization of two well-known objects: the line graph and the dual hypergraph. We obtain various characterizations of line hypergraphs; we also obtain a generalization of Whitney's theorem. The NP-completeness of the problem of determining whether a given graph is the line graph of a hypergraph of rank $r>2$ is proved.