Representation of Planar Hypergraphs by Contacts of Triangles

DOI10.1007/978-3-540-77537-9_15zbMath1137.68508OpenAlexW1596336002MaRDI QIDQ5452217

Pierre Rosenstiehl, Patrice Ossona de Mendez, Hubert de Fraysseix

Publication date: 25 March 2008

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77537-9_15

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The interval number of a planar graph: Three intervals suffice
• How to draw a planar graph on a grid
• Representations by contact and intersection of segments
• Barycentric systems and stretchability
• Rectilinear planar layouts and bipolar orientations of planar graphs
• Planar graphs and poset dimension
• Hypermaps versus bipartite maps
• Maps, hypermaps and their automorphisms: A survey. I
• Hypergraph planarity and the complexity of drawing venn diagrams
• HYPERGRAPHS
• On Triangle Contact Graphs
• The Order Dimension of Planar Maps
• Realization of Posets
• Partially Ordered Sets

This page was built for publication: Representation of Planar Hypergraphs by Contacts of Triangles