Results on hypergraph planarity

Anne Verroust-Blondet (1) , Marie-Luce Viaud (2)

1 IMEDIA - Image and multimedia indexing, browsing and retrieval
2 INA - Institut National de l'Audiovisuel

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.

Mots clés: Hypergraph planarity; vertex planarity; drawing in the edge standard; drawing in the subset standard; Euler diagram

Domaines: Algorithme et structure de données [cs.DS]; Mathématique discrète [cs.DM]

Anne Verroust-Blondet, Marie-Luce Viaud. Results on hypergraph planarity. 2004. ⟨inria-00389591⟩