Representation of planar graphs by segments
De Fraysseix, Hubert ; Ossona De Mendez, Patrice ; Pach, Janos
HAL, hal-00005620 / Harvested from HAL
Text on HAL
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.
Publié le : 1991-07-05
Classification:  graph drawing,  contact representation,  05C62,  [MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO] 
@article{hal-00005620,
     author = {De Fraysseix, Hubert and Ossona De Mendez, Patrice and Pach, Janos},
     title = {Representation of planar graphs by segments},
     journal = {HAL},
     volume = {1991},
     number = {0},
     year = {1991},
     language = {en},
     url = {http://dml.mathdoc.fr/item/hal-00005620}
}

De Fraysseix, Hubert; Ossona De Mendez, Patrice; Pach, Janos. Representation of planar graphs by segments. HAL, Tome 1991 (1991) no. 0, . http://gdmltest.u-ga.fr/item/hal-00005620/