A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

Information Processing Letters

Volumn 66, Issue 3, 1998, Pages 125-126

  Czyzowicz, Jurek ^a   Kranakis, Evangelos ^b   Urrutia, Jorge ^c  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^b CARLETON UNIVERSITY   (Canada)

^c UNIVERSITY OF OTTAWA   (Canada)

Author keywords

Bipartite; Contact; Line segments; Orthogonal; Planar

Indexed keywords

EID: 0041762775     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(98)00046-5     Document Type: Article

References (1)

1. H. de Fraysseix, P.O. de Mendez, J. Pach, A left-first search algorithm for planar graphs, Discrete Comput. Geom. 13 (1995) 459-468.