Inner Rectangular Drawings of Plane Graphs

A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner rectangular drawing has some applications to VLSI layouts. In this talk we show that a plane graph G has an inner rectangular drawing D if and only if a new bipartite graph constructed from G has a perfect matching. We also show that D

• Type: Conference
• Year: 2004
• Where: ISAAC
• Authors: Kazuyuki Miura, Hiroki Haga, Takao Nishizeki
• Keywords: Inner Face, Inner Rectangular Drawing, ISAAC 2004, Plane Graph