Abstract
Many representation theorems extend from planar graphs to planar hypergraphs. The authors proved in [10] 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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Andreev, E.M.: On convex polyhedra in Lobačevskiǐ spaces. Matematicheskii Sbornik 81, 445–478 (1970)
Berge, C.: Graphes et hypergraphes, 2nd edn. Dunod, Paris (1973)
Brightwell, G., Trotter, W.T.: The order dimension of planar maps. SIAM journal on Discrete Mathematics 10(4), 515–528 (1997)
Cori, R.: Un code pour les graphes planaires et ses applications, Société Mathématique de France, Paris, vol. 27 (1975)
Cori, R., Machì, A.: Maps, hypermaps and their automorphisms. Expo. Math. 10, 403–467 (1992)
Dushnik, B., Miller, E.W.: Partially ordered sets. Amer. J. Math. 63, 600–610 (1941)
de Fraysseix, H., Ossona de Mendez, P.: Intersection Graphs of Jordan Arcs, Contemporary Trends in Discrete Mathematics. In: DIMATIA-DIMACS. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Štiřin 1997 Proc., pp. 11–28 (1999)
de Fraysseix, H., Ossona de Mendez, P.: Barycentric systems and stretchability. Discrete Applied Mathematics 155(9), 1079–1095 (2007)
de Fraysseix, H., Ossona de Mendez, P.: On representations by contact and intersection of segments. Algorithmica 47(4), 453–463 (2007)
de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P.: On triangle contact graphs. Combinatorics, Probability and Computing 3, 233–246 (1994)
de Fraysseix, H., Pach, J., Pollack, R.: Small sets supporting Fary embeddings of planar graphs. In: 20th Annual ACM Symposium on Theory of Computing, pp. 426–433 (1988)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10, 41–51 (1990)
Johnson, D.S., Pollak, H.O.: Hypergraph planarity and the complexity of drawing Venn diagrams. Journal of Graph Theory 11(3), 309–325 (1987)
Jones, R.P.: Colourings of hypergraphs, Ph.D. thesis, Royal Holloway College, Egham, p. 209 (1976)
Koebe, P.: Kontaktprobleme der konformen Abbildung. Ber. Verh. Schs. Akad. Wiss. Leipzig, Math.-Phys. Kl. 88, 141–164 (1936)
Ossona de Mendez, P.: Orientations bipolaires, Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris (1994)
Ossona de Mendez, P.: Geometric Realization of Simplicial Complexes, Graph Drawing. In: Kratochvíl, J. (ed.) GD 1999. LNCS, vol. 1731, pp. 323–332. Springer, Heidelberg (1999)
Ossona de Mendez, P.: Realization of posets. Journal of Graph Algorithms and Applications 6(1), 149–153 (2002)
Rosenstiehl, P., Tarjan, R.E.: Rectilinear planar layout and bipolar orientation of planar graphs. Discrete and Computational Geometry 1, 343–353 (1986)
Scheinerman, E.R.: Intersection classes and multiple intersection parameters of graphs, Ph.D. thesis, Princeton University (1984)
Scheinerman, E.R., West, D.B.: The interval number of a planar graph: Three intervals suffice. Journal of Combinatorial Theory, Series B 35, 224–239 (1983)
Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)
Schnyder, W.: Embedding planar graphs in the grid. In: First ACM-SIAM Symposium on Discrete Algorithms, pp. 138–147 (1990)
Tamassia, R., Tollis, I.G.: Tessalation representation of planar graphs. In: Proc. Twenty-Seventh Annual Allerton Conference on Communication, Control, and Computing, pp. 48–57 (1989)
Trotter, W.T.: Combinatorics and partially ordered sets: Dimension theory. John Hopkins series in the mathematical sciences. Johns Hopkins University Press, London (1992)
Walsh, T.R.S.: Hypermaps versus bipartite maps. J. Combinatorial Theory 18(B), 155–163 (1975)
White, A.T.: Graphs, Groups and Surfaces, revised edn. Mathematics Studies, vol. 8. North-Holland, Amsterdam (1984)
Zykov, A.A.: Hypergraphs. Uspeki Mat. Nauk 6, 89–154 (1974)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Fraysseix, H., Ossona de Mendez, P., Rosenstiehl, P. (2008). Representation of Planar Hypergraphs by Contacts of Triangles. In: Hong, SH., Nishizeki, T., Quan, W. (eds) Graph Drawing. GD 2007. Lecture Notes in Computer Science, vol 4875. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77537-9_15
Download citation
DOI: https://doi.org/10.1007/978-3-540-77537-9_15
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77536-2
Online ISBN: 978-3-540-77537-9
eBook Packages: Computer ScienceComputer Science (R0)