DeepAI AI Chat
Log In Sign Up

4-connected planar graphs are in B_3-EPG

10/12/2017
by   Therese Biedl, et al.
University of Waterloo
labri
0

We show that every 4-connected planar graph has a B_3-EPG representation, i.e., every vertex is represented by a curve on the grid with at most three bends, and two vertices are adjacent if and only if the corresponding curves share an edge of the grid. Our construction is based on a modification of the representation by touching thickened L-shapes proposed by Gonçalves et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/08/2018

Separators for Planar Graphs that are Almost Trees

We prove that a connected planar graph with n vertices and n+μ edges has...
12/12/2020

Lions and contamination, triangular grids, and Cheeger constants

Suppose each vertex of a graph is originally occupied by contamination, ...
10/16/2018

Segment representations with small resolution

A segment representation of a graph is an assignment of line segments in...
10/11/2017

Grid peeling and the affine curve-shortening flow

In this paper we study an experimentally-observed connection between two...
01/08/2018

Optimal Morphs of Planar Orthogonal Drawings

We describe an algorithm that morphs between two planar orthogonal drawi...
01/28/2022

Unfolding Orthotubes with a Dual Hamiltonian Path

An orthotube consists of orthogonal boxes (e.g., unit cubes) glued face-...
05/05/2020

Grid Drawings of Graphs with Constant Edge-Vertex Resolution

We study the algorithmic problem of computing drawings of graphs in whic...