21746 articles – 15574 references  [version française]
HAL: hal-00005620, version 1

Detailed view  Export this paper
Intuitive Geometry 63 (1991) 109-117
Representation of planar graphs by segments
Hubert De Fraysseix 1, Patrice Ossona De Mendez 1, Janos Pach
(1991)

Given any bipartite planar graph G, one can assign vertical and horizontal segments to its vertices so that (a) no two of them have an interior point in common, (b) two segments have a point in common if and only if the corresponding vertices are adjacent in G.
1:  Centre d'analyse et de mathématique sociale (CAMS)
CNRS : UMR8557 – École des Hautes Études en Sciences Sociales [EHESS]
Mathematics/Combinatorics
graph drawing – contact representation