Results on hypergraph planarity
Anne Verroust-Blondet, Marie-Luce Viaud · 2004
Abstract. Using the notion of planarity and drawing for hypergraphs introduced respectively by Johnson and Pollak [9] and Mäkinen [14], 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. Key words: hypergraphs, planarity, vertex-planarity, drawing in the edge standard, drawing in the subset standard, Euler diagrams 1