Rook-drawings of Plane Graphs - Archive ouverte HAL Access content directly
Journal Articles Journal of Graph Algorithms and Applications Year : 2017

Rook-drawings of Plane Graphs


We introduce a new type of graph drawing called " rook-drawing ". A rook-drawing of a graph G is obtained by placing the n nodes of G on the intersections of a regular grid, such that each row and column of the grid supports exactly one node. This paper focuses on rook-drawings of planar graphs. We first give a linear algorithm to compute a planar straight-line rook-drawing for outerplanar graphs. We then characterize the maximal planar graphs admitting a planar straight-line rook-drawing, which are unique for a given order. Finally, we give a linear time algorithm to compute a polyline planar rook-drawing for plane graphs with at most n − 3 bent edges.
Fichier principal
Vignette du fichier
rook-drawing-jgaa.pdf (453.33 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01431637 , version 1 (11-01-2017)


  • HAL Id : hal-01431637 , version 1


David Auber, Nicolas Bonichon, Paul Dorbec, Claire Pennarun. Rook-drawings of Plane Graphs. Journal of Graph Algorithms and Applications, 2017, 21 (1), pp.103-120. ⟨hal-01431637⟩


147 View
111 Download


Gmail Facebook Twitter LinkedIn More