Results on hypergraph planarity

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.
Complete list of metadatas

Cited literature [17 references]  Display  Hide  Download

https://hal.inria.fr/inria-00389591
Contributor : Anne Verroust-Blondet <>
Submitted on : Friday, May 29, 2009 - 10:05:45 AM
Last modification on : Thursday, October 10, 2019 - 1:16:29 AM
Long-term archiving on : Thursday, June 10, 2010 - 7:55:06 PM

File

hypergraphplanarity.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00389591, version 1

Collections

Citation

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

Share

Metrics

Record views

175

Files downloads

212