Results on hypergraph planarity
Résumé
Using the notion of planarity and drawing for hypergraphs introduced respectively by Johnson and Pollak [JP87] and Mäkinen [Ma90], we show in this paper that any hypergraph having less than nine hyperedges is vertex-planar and can be drawn in the edge standard and in the subset standard without edge crossing.
Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...