Representation of planar hypergraphs by contacts of triangles

Authors:
Hubert de Fraysseix;Patrice Ossona de Mendez;Pierre Rosenstiehl
Affiliations:
CAMS UMR, CNRS, EHESS, Paris, France;CAMS UMR, CNRS, EHESS, Paris, France;CAMS UMR, CNRS, EHESS, Paris, France
Venue:
GD'07 Proceedings of the 15th international conference on Graph drawing
Year:
2007

Citing 5
Cited 1

Small sets supporting fary embeddings of planar graphs

STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Embedding planar graphs on the grid

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
The Order Dimension of Planar Maps

SIAM Journal on Discrete Mathematics
Representations by Contact and Intersection of Segments

Algorithmica
Barycentric systems and stretchability

Discrete Applied Mathematics

On touching triangle graphs

GD'10 Proceedings of the 18th international conference on Graph drawing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many representation theorems extend from planar graphs to planar hypergraphs. The authors proved in that every planar graph has a representation by contact of triangles. We prove here that this representation result extend to planar linear hypergraphs. Although the graph proof was simple and led to a linear time drawing algorithm, the extension for hypergraphs needs more work. The proof we give here relies on a combinatorial characterization of those hypergraphs which are representable by contact of segments in the plane, We propose some possible generalization directions and open problems, related to the order dimension of the incidence posets of hypergraphs.