| A.A. Zykov. Hypergraphs. Uspeki Mat. Nauk, 6:89-154, 1974. |
....E i 6= 8i 2 I) and S i2I E i = X . The elements of X and E are respectively the vertices and the edges (or hyperedges) of the hypergraph. Di erent generalizations of the concept of planarity to hypergraphs have been proposed (See [16] for instance) The rst generalization is due to Zykov [36]. He proposed to represent the edges of a hypergraph by a subset of the faces of a planar map. Walsh [34] has shown that Zykov s de nition (as well as another de nition due to Cori [5] is equivalent to the following: A hypergraph is planar if and only if its vertex edge incidence graph is planar ....
A.A. Zykov. Hypergraphs. Uspeki Mat. Nauk, 6:89-154, 1974.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC