Results on hypergraph planarity - Archive ouverte HAL Access content directly
Other Publications Year : 2004

Results on hypergraph planarity

(1) , (2)
1
2

Abstract

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.
Fichier principal
Vignette du fichier
hypergraphplanarity.pdf (246.19 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00389591 , version 1 (29-05-2009)

Identifiers

  • HAL Id : inria-00389591 , version 1

Cite

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

Share

Gmail Facebook Twitter LinkedIn More