论文信息 - 4-connected planar graphs are in B3-EPG

4-connected planar graphs are in B3-EPG

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 Goncalves et al.

Therese C. Biedl | Claire Pennarun

[1] Jérémie Chalopin,et al. Planar Graphs Have 1-string Representations , 2010, Discret. Comput. Geom..

[2] Goos Kant,et al. On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, Algorithmica.

[3] Goos Kant,et al. On Triangulating Planar Graphs under the Four-Connectivity Constraint , 1994, SWAT.

[4] Jérémie Chalopin,et al. Every planar graph is the intersection graph of segments in the plane: extended abstract , 2009, STOC '09.

[5] H. Whitney. A Theorem on Graphs , 1931 .

[6] Claire Pennarun,et al. Planar Graphs as L-intersection or L-contact graphs , 2017, SODA.

[7] Kolja B. Knauer,et al. On the Bend-Number of Planar and Outerplanar Graphs , 2011, LATIN.